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: "online truthful mechanisms for multi sided markets"
  Abstract: The study of mechanisms for multi-sided markets has received an increasingly growing attention from the research community, and is motivated by the numerous examples of such markets on the web and in electronic commerce. Many of these examples represent dynamic and uncertain environments, and thus, require, in fact, online mechanisms. Unfortunately, as far as we know, no previously published online mechanism for a multi-sided market (or even for a double-sided market) has managed to (approximately) maximize the gain from trade, while guaranteeing desirable economic properties such as incentivizing truthfulness, voluntary participation and avoiding budget deficit. In this work we present the first online mechanism for a multi-sided market which has the above properties. Our mechanism is designed for a market setting suggested by [Feldman and Gonen (2016)]; which is motivated by the foreseeable future form of online advertising. #R##N#The online nature of our setting motivated us to define a stronger notion of individual rationality, called "continuous individual rationality", capturing the natural requirement that a player should never lose either by participating in the mechanism or by not leaving prematurely. Satisfying the requirements of continuous individual rationality, together with the other economic properties our mechanism guarantees, requires the mechanism to use a novel pricing scheme where users may be paid ongoing increments during the mechanism's execution up to a pre-known maximum value. As users rarely ever get paid in reality, this pricing scheme is new to mechanism design. Nevertheless, the principle it is based on can be observed in many common real life scenarios such as executive compensation payments and company acquisition deals. We believe both our new dynamic pricing scheme concept and our strengthened notion of individual rationality are of independent interest.

Connected through hyperedge HE-1 (induced by source paper "multi unit bilateral trade"):
  with members:
    - "online trading as a secretary problem"
    - "approximating gains from trade in two sided markets via simple mechanisms"
    - "fixed price approximability of the optimal gain from trade"
    - "muda a truthful multi unit double auction mechanism"
    - "online market intermediation"
    - "almost efficient mechanisms for bilateral trading"
    - "simple and near optimal mechanisms for market intermediation"

Connected through hyperedge HE-2 (induced by source paper "fixed price approximability of the optimal gain from trade"):
  with members:
    - "approximating gains from trade in two sided markets via simple mechanisms"
    - "online market intermediation"
    - "markets with strategic multi minded mediators"
    - "sbba a strongly budget balanced double auction mechanism"
    - "approximately efficient two sided combinatorial auctions"

Connected through hyperedge HE-3 (induced by source paper "markets with strategic multi minded mediators"):
  with members:
    - "mechanism design with strategic mediators"

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)