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 "clearing markets via bundles"):
  Abstract: We study algorithms for combinatorial market design problems, where a set of heterogeneous and indivisible objects are priced and sold to potential buyers subject to equilibrium constraints. Extending the CWE notion introduced by Feldman et al. [STOC 2013], we introduce the concept of a Market-Clearing Combinatorial Walrasian Equilibium (MC-CWE) as a natural relaxation of the classical Walrasian equilibrium (WE) solution concept. The only difference between a MC-CWE and a WE is the ability for the seller to bundle the items prior to sale. This innocuous and natural bundling operation imposes a plethora of algorithmic and economic challenges and opportunities. Unlike WE, which is guaranteed to exist only for (gross) substitutes valuations, a MC-CWE always exists. The main algorithmic challenge, therefore, is to design computationally efficient mechanisms that generate MC-CWE outcomes that approximately maximize social welfare. For a variety of valuation classes encompassing substitutes and complements (including super-additive, single-minded and budget-additive valuations), we design polynomial-time MC-CWE mechanisms that provide tight welfare approximation results.

Includes members:
  Member "combinatorial walrasian equilibrium":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the power and limits of dynamic pricing in combinatorial markets")
  Member "lower bound for envy free and truthful makespan approximation on related machines":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "envy regret and social welfare loss")
  Member "optimization with demand oracles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight approximation for unconstrained xos maximization")
  Member "an impossibility result for truthful combinatorial auctions with submodular valuations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "envy multi envy and revenue maximization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "envy regret and social welfare loss")
  Member "bundling equilibrium in combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "truthfulness with value maximizing bidders")

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)