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 "polyhedral clinching auctions for two sided markets"):
  Abstract: In this paper, we present a new model and mechanism for auctions in two-sided markets of buyers and sellers, with budget constraints imposed on buyers. Our mechanism is viewed as a two-sided extension of the polyhedral clinching auction by Goel et al., and enjoys various nice properties, such as incentive compatibility of buyers, individual rationality, pareto optimality, strong budget balance. Our framework is built on polymatroid theory, and hence is applicable to a wide variety of models that include multiunit auctions, matching markets and reservation exchange markets.

Includes members:
  Member "clinching auctions beyond hard budget constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interpolating between truthful and non truthful mechanisms for combinatorial auctions")
  Member "polyhedral clinching auctions and the adwords polytope":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pricing in resource allocation games based on lagrangean duality and convexification")
  Member "clinching auctions with online supply":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interpolating between truthful and non truthful mechanisms for combinatorial auctions")
  Member "incentive compatible budget elicitation in multi unit auctions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a simple mechanism for a budget constrained buyer")

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)