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 complexity of computing an equilibrium in combinatorial auctions"):
  Abstract: We study combinatorial auctions where each item is sold separately but simultaneously via a second price auction. We ask whether it is possible to efficiently compute in this game a pure Nash equilibrium with social welfare close to the optimal one. #R##N#We show that when the valuations of the bidders are submodular, in many interesting settings (e.g., constant number of bidders, budget additive bidders) computing an equilibrium with good welfare is essentially as easy as computing, completely ignoring incentives issues, an allocation with good welfare. On the other hand, for subadditive valuations, we show that computing an equilibrium requires exponential communication. Finally, for XOS (a.k.a. fractionally subadditive) valuations, we show that if there exists an efficient algorithm that finds an equilibrium, it must use techniques that are very different from our current ones.

Includes members:
  Member "economic efficiency requires interaction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  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 "composable and efficient mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "simultaneous auctions are almost efficient":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "optimization with demand oracles":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tight approximation for unconstrained xos maximization")
  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)