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 "double auctions in markets for multiple kinds of goods"):
  Abstract: Motivated by applications such as stock exchanges and spectrum auctions, there is a growing interest in mechanisms for arranging trade in two-sided markets. Existing mechanisms are either not truthful, or do not guarantee an asymptotically-optimal gain-from-trade, or rely on a prior on the traders' valuations, or operate in limited settings such as a single kind of good. We extend the random market-halving technique used in earlier works to markets with multiple kinds of goods, where traders have gross-substitute valuations. We present MIDA: a Multi Item-kind Double-Auction mechanism. It is prior-free, truthful, strongly-budget-balanced, and guarantees near-optimal gain from trade when market sizes of all goods grow to $\infty$ at a similar rate.

Includes members:
  Member "approximating gains from trade in two sided markets via simple mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient two sided markets with limited information")
  Member "polyhedral clinching auctions for two sided markets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "muda a truthful multi unit double auction mechanism")
  Member "fixed price approximability of the optimal gain from trade":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient two sided markets with limited information")
  Member "approximately efficient two sided combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient two sided markets with limited information")
  Member "the pseudo dimension of near optimal auctions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "settling the sample complexity of single parameter revenue maximization")
  Member "on random sampling auctions for digital goods":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "profit maximizing prior free multi unit procurement auctions with capacitated sellers")
  Member "prior independent mechanisms for scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the vickrey auction with a single duplicate bidder approximates the optimal revenue")
  Member "ascending auctions and walrasian equilibrium":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "do prices coordinate markets")

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)