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 "mechanism design for large scale systems"):
  Abstract: In this paper, we consider infinite number of non atomic self-interested agents with private valuation of a divisible good. We design a pricing mechanism that is easy to implement, is individually rational, weakly budget balanced and incentive compatible. In this mechanism, agents send reports of their types, based on which, the designer solves a constrained optimization problem through Lagrange's mechanism. The resulting optimal allocation and Lagrange's multiplier is sent as the allocation and prices to the respective agent. We show that reporting one's type truthfully is a dominant strategy of the players in this mechanism. We then extend this idea to the dynamic case, when player's types are dynamically evolving as a controlled Markov process. In this case, in each time period, reporting one's type is a dominant strategy of the players.

Includes members:
  Member "efficient network sharing with asymmetric constraint information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless power transfer with information asymmetry a public goods perspective")
  Member "distributed mechanism design with learning guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient network sharing with asymmetric constraint information")

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)