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 "efficient allocation via sequential scrip auctions"):
  Abstract: We study the problem of allocating items to two agents with arbitrary valuation functions. Instead of actual money, we use sequential auctions with "scrip money", i.e. money that has no value outside the auction. #R##N#By considering such scrip auctions as a special case of more general \emph{bidding games}, we show that there exists a natural pure subgame perfect Nash equilibrium (PSPE) with the following desirable properties: (a) agents' utility is weakly monotone in their budget; (b) a Pareto-efficient outcome is reached for any initial budget; and (c) for any Pareto-efficient outcome there is an initial budget s.t. this outcome is attained. In particular, we can assign the budget so as to implement the outcome with maximum social welfare, maximum Egalitarian welfare, etc. #R##N#We provide an efficient algorithm to compute a PSPE in bidding games, and draw implications of the above result for various games and mechanism design problems.

Includes members:
  Member "sequential auctions of identical items with budget constrained bidders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "infinite duration poorman bidding games")
  Member "bundling equilibrium in combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "truthfulness with value maximizing bidders")

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)