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: "the robust price of anarchy of altruistic games"
  Abstract: We study the inefficiency of equilibria for various classes of games when players are (partially) altruistic. We model altruistic behavior by assuming that player i's perceived cost is a convex combination of 1-\alpha_i times his direct cost and \alpha_i times the social cost. Tuning the parameters \alpha_i allows smooth interpolation between purely selfish and purely altruistic behavior. Within this framework, we study altruistic extensions of linear congestion games, fair cost-sharing games and valid utility games. #R##N#We derive (tight) bounds on the price of anarchy of these games for several solution concepts. Thereto, we suitably adapt the smoothness notion introduced by Roughgarden and show that it captures the essential properties to determine the robust price of anarchy of these games. Our bounds show that for congestion games and cost-sharing games, the worst-case robust price of anarchy increases with increasing altruism, while for valid utility games, it remains constant and is not affected by altruism. However, the increase in the price of anarchy is not a universal phenomenon: for symmetric singleton linear congestion games, we derive a bound on the pure price of anarchy that decreases as the level of altruism increases. Since the bound is also strictly lower than the robust price of anarchy, it exhibits a natural example in which Nash equilibria are more efficient than more permissive notions of equilibrium.

Connected through hyperedge HE-1 (induced by source paper "prior independent equilibria and linear multi dimensional bayesian games"):
  with members:
    - "network cournot competition"
    - "graphical models for game theory"
    - "prior independent auctions for risk averse agents"
    - "multi games and a double game extension of the prisoner s dilemma"
    - "price of anarchy for greedy auctions"

Connected through hyperedge HE-2 (induced by source paper "online best reply algorithms for resource allocation problems"):
  with members:
    - "the price of stability of weighted congestion games"
    - "a unifying tool for bounding the quality of non cooperative solutions in weighted congestion games"

Connected through hyperedge HE-3 (induced by source paper "achieving an efficient and fair equilibrium through taxation"):
  with members:
    - "two sided matching based cooperative spectrum sharing"
    - "economic analysis of crowdsourced wireless community networks"
    - "public wi fi monetization via advertising"
    - "efficient and fair collaborative mobile internet access"
    - "an integrated spectrum and information market for green cognitive communications"
    - "mine gold to deliver green cognitive communications"
    - "combining spot and futures markets a hybrid market approach to dynamic spectrum access"
    - "stable nash equilibria of medium access games under symmetric socially altruistic behavior"

Connected through hyperedge HE-4 (induced by source paper "towards decision support in reciprocation"):
  with members:
    - "how bad is forming your own opinion"
    - "altruism in atomic congestion games"

Connected through hyperedge HE-5 (induced by source paper "playing the wrong game smoothness bounds for congestion games with behavioral biases"):
  with members:
    - "the price of anarchy in large games"
    - "asymptotically tight bounds for inefficiency in risk averse selfish routing"
    - "the burden of risk aversion in mean risk selfish routing"
    - "congestion games with distance based strict uncertainty"
    - "improving the price of anarchy for selfish routing via coordination mechanisms"

Connected through hyperedge HE-6 (induced by source paper "playing the wrong game bounding externalities in diverse populations of agents"):
  with members:
    - "the impact of worst case deviations in non atomic network routing games"
    - "informational braess paradox the effect of information on traffic congestion"
    - "the burden of risk aversion in mean risk selfish routing"
    - "congestion games with distance based strict uncertainty"

Connected through hyperedge HE-7 (induced by source paper "bounding the inefficiency of altruism through social contribution games"):
  with members:
    - "bayesian games and the smoothness framework"
    - "composable and efficient mechanisms"
    - "inner product spaces for minsum coordination mechanisms"
    - "altruism in atomic congestion games"

Connected through hyperedge HE-8 (induced by source paper "on linear congestion games with altruistic social context"):
  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"
    - "altruism in atomic congestion games"

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)