human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "sbba a strongly budget balanced double auction mechanism"):
  with members:
    - "welfare undominated groves mechanisms"
    - "concurrent auctions across the supply chain"

Question: Please tell me which class the center node 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)