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 "multi unit bilateral trade"):
  Abstract: We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular. #R##N#Furthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e) approximation mechanism, matching the best known bounds for the single-item setting.

Includes members:
  Member "online trading as a secretary problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient two sided markets with limited information")
  Member "approximating gains from trade in two sided markets via simple mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient two sided markets with limited information")
  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 "muda a truthful multi unit double auction mechanism":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "approximately maximizing the broker s profit in a two sided market")
  Member "online market intermediation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient two sided markets with limited information")
  Member "almost efficient mechanisms for bilateral trading":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient two sided markets with limited information")
  Member "online truthful mechanisms for multi sided markets":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fixed price approximability of the optimal gain from trade")
  Member "simple and near optimal mechanisms for market intermediation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efficient two sided markets with limited information")

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)