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 "price competition in online combinatorial markets"):
  Abstract: We consider a single buyer with a combinatorial preference that would like to purchase related products and services from different vendors, where each vendor supplies exactly one product. We study the general case where subsets of products can be substitutes as well as complementary and analyze the game that is induced on the vendors, where a vendor's strategy is the price that he asks for his product. This model generalizes both Bertrand competition (where vendors are perfect substitutes) and Nash bargaining (where they are perfect complements), and captures a wide variety of scenarios that can appear in complex crowd sourcing or in automatic pricing of related products. #R##N#We study the equilibria of such games and show that a pure efficient equilibrium always exists. In the case of submodular buyer preferences we fully characterize the set of pure Nash equilibria, essentially showing uniqueness. For the even more restricted "substitutes" buyer preferences we also prove uniqueness over {\em mixed} equilibria. Finally we begin the exploration of natural generalizations of our setting such as when services have costs, when there are multiple buyers or uncertainty about the the buyer's valuation, and when a single vendor supplies multiple products.

Includes members:
  Member "simultaneous auctions are almost efficient":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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-3 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "frugal mechanism design via spectral techniques":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal budget feasible mechanisms for additive valuations")
  Member "frugal and truthful auctions for vertex covers flows and cuts":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal budget feasible mechanisms for additive valuations")
  Member "combinatorial auctions with decreasing marginal utilities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "frugality ratios and improved truthful mechanisms for vertex cover":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal budget feasible mechanisms for additive valuations")

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)