human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "the price of anarchy in large games"):
  Abstract: Game-theoretic models relevant for computer science applications usually feature a large number of players. The goal of this paper is to develop an analytical framework for bounding the price of anarchy in such models. We demonstrate the wide applicability of our framework through instantiations for several well-studied models, including simultaneous single-item auctions, greedy combinatorial auctions, and routing games. In all cases, we identify conditions under which the POA of large games is much better than that of worst-case instances. Our results also give new senses in which simple auctions can perform almost as well as optimal ones in realistic settings.

Includes members:
  Member "a unifying hierarchy of valuations with complements and substitutes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "beyond submodular maximization")
  Member "an anti folk theorem for large repeated games with imperfect monitoring":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "when does the price of anarchy tend to 1 in large walrasian auctions and fisher markets")
  Member "asymptotically truthful equilibrium selection in large congestion games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "differentially private call auctions and market impact")
  Member "bayesian games and the smoothness framework":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fair allocation of indivisible goods improvement and generalization")
  Member "mechanism design in large games incentives and privacy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "differentially private call auctions and market impact")
  Member "composable and efficient mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "simultaneous auctions are almost efficient":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "non price equilibria in markets of discrete goods":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "complexity theory game theory and economics the barbados lectures")

Question: Please tell me which class the source paper 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)