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: "limits of efficiency in sequential auctions"
  Abstract: We study the efficiency of sequential first-price item auctions at (subgame perfect) equilibrium. This auction format has recently attracted much attention, with previous work establishing positive results for unit-demand valuations and negative results for submodular valuations. This leaves a large gap in our understanding between these valuation classes. In this work we resolve this gap on the negative side. In particular, we show that even in the very restricted case in which each bidder has either an additive valuation or a unit-demand valuation, there exist instances in which the inefficiency at equilibrium grows linearly with the minimum of the number of items and the number of bidders. Moreover, these inefficient equilibria persist even under iterated elimination of weakly dominated strategies. Our main result implies linear inefficiency for many natural settings, including auctions with gross substitute valuations, capacitated valuations, budget-additive valuations, and additive valuations with hard budget constraints on the payments. Another implication is that the inefficiency in sequential auctions is driven by the maximum number of items contained in any player's optimal set, and this is tight. For capacitated valuations, our results imply a lower bound that equals the maximum capacity of any bidder, which is tight following the upper-bound technique established by Paes Leme et al. \cite{PaesLeme2012}.

Connected through hyperedge HE-1 (induced by source paper "simple mechanisms for agents with complements"):
  with members:
    - "simple auctions for agents with complements"
    - "interpolating between truthful and non truthful mechanisms for combinatorial auctions"
    - "the pseudo dimension of near optimal auctions"
    - "greedy algorithms make efficient mechanisms"
    - "simple mechanisms for a subadditive buyer and applications to revenue monotonicity"
    - "on the complexity of computing an equilibrium in combinatorial auctions"
    - "a simple and approximately optimal mechanism for an additive buyer"
    - "an n to 1 bidder reduction for multi item auctions and its applications"

Connected through hyperedge HE-2 (induced by source paper "on the inefficiency of standard multi unit auctions"):
  with members:
    - "tight bounds for the price of anarchy of simultaneous first price auctions"
    - "bayesian games and the smoothness framework"
    - "bayesian sequential auctions"
    - "online submodular welfare maximization greedy is optimal"
    - "sequential auctions and externalities"
    - "non price equilibria in markets of discrete goods"
    - "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)