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 "on the inefficiency of the uniform price auction"):
  Abstract: We present our results on Uniform Price Auctions, one of the standard sealed-bid multi-unit auction formats, for selling multiple identical units of a single good to multi-demand bidders. Contrary to the truthful and economically efficient multi-unit Vickrey auction, the Uniform Price Auction encourages strategic bidding and is socially inefficient in general. The uniform pricing rule is, however, widely popular by its appeal to the natural anticipation, that identical items should be identically priced. In this work we study equilibria of the Uniform Price Auction for bidders with (symmetric) submodular valuation functions, over the number of units that they win. We investigate pure Nash equilibria of the auction in undominated strategies; we produce a characterization of these equilibria that allows us to prove that a fraction 1-1/e of the optimum social welfare is always recovered in undominated pure Nash equilibrium -- and this bound is essentially tight. Subsequently, we study the auction under the incomplete information setting and prove a bound of 4-2/k on the economic inefficiency of (mixed) Bayes Nash equilibria that are supported by undominated strategies.

Includes members:
  Member "pricing public goods for private sale":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "inducing equilibria in networked public goods games through network structure modification")
  Member "bounding the inefficiency of outcomes in generalized second price auctions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the tractability of public persuasion with no externalities")
  Member "bayesian games and the smoothness framework":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fair allocation of indivisible goods improvement and generalization")
  Member "sequential auctions and externalities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reserve pricing in repeated second price auctions with strategic bidders")
  Member "non price equilibria in markets of discrete goods":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "mechanisms for multi unit auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "price doubling and item halving robust revenue guarantees for item pricing")
  Member "price of anarchy for greedy auctions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "proportional dynamics in exchange economies")
  Member "combinatorial auctions with decreasing marginal utilities":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "complexity theory game theory and economics the barbados lectures")

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)