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 "bidding games and efficient allocations"):
  Abstract: Bidding games are extensive form games, where in each turn players bid in order to determine who will play next. Zero-sum bidding games (also known as Richman games) have been extensively studied, focusing on the fraction of the initial budget that can guaranty the victory of each player [Lazarus et al.'99, Develin and Payne'10]. #R##N#We extend the theory of bidding games to general-sum two player games, showing the existence of pure subgame-perfect Nash equilibria (PSPE), and studying their properties. #R##N#We show that if the underlying game has the form of a binary tree (only two actions available to the players in each node), then there exists a natural PSPE with the following highly desirable properties: (a) players' 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 show implications of this result for combinatorial bargaining. In particular, we show that the PSPE above is fair, in the sense that a player with a fraction of X% of the total budget prefers her allocation to X% of the possible allocations. #R##N#In addition, we discuss the computational challenges of bidding games, and provide a polynomial-time algorithm to compute the PSPE.

Includes members:
  Member "bayesian sequential auctions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online submodular welfare maximization greedy beats 1 2 in random order")
  Member "sequential auctions of identical items with budget constrained bidders":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "infinite duration poorman bidding games")
  Member "sequential auctions and externalities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reserve pricing in repeated second price auctions with strategic 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)