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 "mida a multi item type double auction mechanism"):
  Abstract: In a seminal paper, McAfee (1992) presented a truthful mechanism for double auction, attaining asymptotically-optimal gain-from-trade without any prior information on the valuations of the traders. McAfee’s mechanism handles single-parametric agents, allowing each seller to sell a single item and each buyer to buy a single item. In this paper, we extend McAfee’s mechanism to handle multi-parametric agents and allow multiple items per trader. We consider three different settings. (1) There is one item-type. Each seller is endowed with several units of that item and each buyer may want several units of that item. Buyers and sellers have diminishing marginal returns. (2) There are multiple item-types. Each seller is endowed with several units of a pre-specified type and the buyers have unit-demand valuations. (3) There are multiple item-types. Each seller is endowed with several units of a pre-specified type and the buyers have gross-substitute valuations. The mechanism is a combination of random-sampling, posted pricing and twosided random-serial-dictatorship. It is prior-free, universally individually-rational, dominant-strategy truthful and strongly budget-balanced. Its gain-from-trade approaches the optimum when the market in all item types is sufficiently large.

Includes members:
  Member "demand flow of agents with gross substitute valuations":
    also connected through other hyperedges:
      (none)
  Member "do prices coordinate markets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the power and limits of dynamic pricing in combinatorial markets")
  Member "the sample complexity of revenue maximization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "the pseudo dimension of near optimal auctions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "settling the sample complexity of single parameter revenue maximization")
  Member "making the most of your samples":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "prior independent mechanisms for scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the vickrey auction with a single duplicate bidder approximates the optimal revenue")
  Member "envy freedom and prior free mechanism design":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "benchmark design and prior independent optimization")
  Member "mechanism design via correlation gap":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "prophet inequalities with linear correlations and augmentations")

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)