human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on linear congestion games with altruistic social context"
  Abstract: We study the issues of existence and inefficiency of pure Nash equilibria in linear congestion games with altruistic social context, in the spirit of the model recently proposed by de Keijzer {\em et al.} \cite{DSAB13}. In such a framework, given a real matrix $\Gamma=(\gamma_{ij})$ specifying a particular social context, each player $i$ aims at optimizing a linear combination of the payoffs of all the players in the game, where, for each player $j$, the multiplicative coefficient is given by the value $\gamma_{ij}$. We give a broad characterization of the social contexts for which pure Nash equilibria are always guaranteed to exist and provide tight or almost tight bounds on their prices of anarchy and stability. In some of the considered cases, our achievements either improve or extend results previously known in the literature.

Connected through hyperedge HE-1 (induced by source paper "the impact of tribalism on social welfare"):
  with members:
    - "graphical models for game theory"
    - "bounding the inefficiency of altruism through social contribution games"
    - "friendship altruism and reward sharing in stable matching and contribution games"
    - "how bad is forming your own opinion"

Connected through hyperedge HE-2 (induced by source paper "on the robustness of the approximate price of anarchy in generalized congestion games"):
  with members:
    - "bounding the inefficiency of altruism through social contribution games"
    - "a unifying tool for bounding the quality of non cooperative solutions in weighted congestion games"
    - "on the performance of approximate equilibria in congestion games"

Connected through hyperedge HE-3 (induced by source paper "a unifying tool for bounding the quality of non cooperative solutions in weighted congestion games"):
  with members:
    - "on the robustness of the approximate price of anarchy in generalized congestion games"
    - "oblivious algorithms for the maximum directed cut problem"
    - "on the performance of approximate equilibria in congestion games"
    - "greedy facility location algorithms analyzed using dual fitting with factor revealing lp"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.GT(Computer Science and Game Theory)