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 "composable and efficient mechanisms"):
  Abstract: We initiate the study of efficient mechanism design with guaranteed good properties even when players participate in multiple different mechanisms simultaneously or sequentially. We define the class of smooth mechanisms, related to smooth games defined by Roughgarden, that can be thought of as mechanisms that generate approximately market clearing prices. We show that smooth mechanisms result in high quality outcome in equilibrium both in the full information setting and in the Bayesian setting with uncertainty about participants, as well as in learning outcomes. Our main result is to show that such mechanisms compose well: smoothness locally at each mechanism implies efficiency globally. #R##N#For mechanisms where good performance requires that bidders do not bid above their value, we identify the notion of a weakly smooth mechanism. Weakly smooth mechanisms, such as the Vickrey auction, are approximately efficient under the no-overbidding assumption. Similar to smooth mechanisms, weakly smooth mechanisms behave well in composition, and have high quality outcome in equilibrium (assuming no overbidding) both in the full information setting and in the Bayesian setting, as well as in learning outcomes. #R##N#In most of the paper we assume participants have quasi-linear valuations. We also extend some of our results to settings where participants have budget constraints.

Includes members:
  Member "bayesian games and the smoothness framework":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fair allocation of indivisible goods improvement and generalization")
  Member "bayesian sequential auctions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online submodular welfare maximization greedy beats 1 2 in random order")
  Member "polyhedral clinching auctions and the adwords polytope":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "pricing in resource allocation games based on lagrangean duality and convexification")
  Member "sequential auctions of identical items with budget constrained bidders":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "infinite duration poorman bidding games")
  Member "simultaneous auctions are almost efficient":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "sequential auctions and externalities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "price of anarchy for greedy auctions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "proportional dynamics in exchange economies")

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)