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 auctions"):
  Abstract: This survey outlines a general and modular theory for proving approximation guarantees for equilibria of auctions in complex settings. This theory complements traditional economic techniques, which generally focus on exact and optimal solutions and are accordingly limited to relatively stylized settings. #R##N#We highlight three user-friendly analytical tools: smoothness-type inequalities, which immediately yield approximation guarantees for many auction formats of interest in the special case of complete information and deterministic strategies; extension theorems, which extend such guarantees to randomized strategies, no-regret learning outcomes, and incomplete-information settings; and composition theorems, which extend such guarantees from simpler to more complex auctions. Combining these tools yields tight worst-case approximation guarantees for the equilibria of many widely-used auction formats.

Includes members:
  Member "a duality based unified approach to bayesian mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "best response dynamics in combinatorial auctions with item bidding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "proportional dynamics in exchange economies")
  Member "simple mechanisms for agents with complements":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capturing complementarity in set functions by going beyond submodularity subadditivity")
  Member "the price of anarchy in large games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "convergence of large atomic congestion games")
  Member "on the economic efficiency of the combinatorial clock auction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "welfare and rationality guarantees for the simultaneous multiple round ascending auction")
  Member "on the efficiency of all pay mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an improved welfare guarantee for first price auctions")
  Member "learning and efficiency in games with dynamic population":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discovering strategic behaviors for collaborative content production in social networks")
  Member "no regret learning in bayesian games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "discovering strategic behaviors for collaborative content production in social networks")

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)