human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "sequential auctions of identical items with budget constrained bidders"
  Abstract: In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only natural equilibrium and is unique under a refinement of subgame perfect equilibria. We show certain interesting properties of this equilibrium; for instance, we show that the prices decrease as the auction progresses. This phenomenon has been observed in many experiments and previous theoretic work attributed it to features such as uncertainty in the supply or risk averse bidders. We show that such features are not needed for this phenomenon and that it arises purely from the most essential features: budget constraints and the sequential nature of the auction. A little surprisingly we also show that in this equilibrium one agent wins all his items in the beginning and then the other agent wins the rest. The major difficulty in analyzing such sequential auctions has been in understanding how the selling prices of the first few rounds affect the utilities of the agents in the later rounds. We tackle this difficulty by identifying certain key properties of the auction and the proof is via a joint induction on all of them.

Connected through hyperedge HE-1 (induced by source paper "infinite duration poorman bidding games"):
  with members:
    - "the efficiency of best response dynamics"
    - "all pay bidding games on graphs"
    - "determinacy in discrete bidding infinite duration games"
    - "quantitative analysis of smart contracts"
    - "infinite duration bidding games"
    - "bidding games and efficient allocations"
    - "optimizing scrip systems crashes altruists hoarders sybils and collusion"
    - "on subgame perfection in quantitative reachability games"

Connected through hyperedge HE-2 (induced by source paper "limits of efficiency in sequential auctions"):
  with members:
    - "bayesian sequential auctions"
    - "composable and efficient mechanisms"
    - "simultaneous auctions are almost efficient"
    - "sequential auctions and externalities"
    - "non price equilibria in markets of discrete goods"
    - "combinatorial auctions with decreasing marginal utilities"

Connected through hyperedge HE-3 (induced by source paper "bidding games and efficient allocations"):
  with members:
    - "bayesian sequential auctions"
    - "sequential auctions and externalities"

Connected through hyperedge HE-4 (induced by source paper "efficient allocation via sequential scrip auctions"):
  with members:
    - "bundling equilibrium in combinatorial auctions"

Connected through hyperedge HE-5 (induced by source paper "composable and efficient mechanisms"):
  with members:
    - "bayesian games and the smoothness framework"
    - "bayesian sequential auctions"
    - "polyhedral clinching auctions and the adwords polytope"
    - "simultaneous auctions are almost efficient"
    - "sequential auctions and externalities"
    - "non price equilibria in markets of discrete goods"
    - "price of anarchy for greedy auctions"
    - "combinatorial auctions with decreasing marginal utilities"

Question: Please tell me which class the center node 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)