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: "markets with strategic multi minded mediators"
  Abstract: We consider the design of mechanisms for multi-sided exchanges that interact with strategic players-some of which have multi-dimension strategic spaces or are represented by mediators. Players act to optimize their own utilities. The mechanism designer, on the other hand, aims to optimize a social goal, i.e., the gain from trade. As the mediators control the information flow from their players to the mechanism, the mechanism faces strategic behavior not only from the players but also from mediators: a mediator acts strategically to maximize utility on behalf of the players he represents. #R##N#In particular, we focus on one example of the above setting which is motivated by the foreseeable future form of online advertising. Online advertising currently supports some of the most important Internet services, including: search, social media and user generated content sites. To overcome privacy concerns, it has been suggested to introduce user information markets through information brokers into the online advertising ecosystem. Such markets give users control over which data get shared in the online advertising exchange. We describe a model for the above foreseeable future form of online advertising, and design two mechanisms for the exchange of this model: a deterministic mechanism which is related to the vast literature on mechanism design through trade reduction and allows players with a multi-dimensional strategic space, and a randomized mechanism which can handle a more general version of the model.

Connected through hyperedge HE-1 (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"
    - "sbba a strongly budget balanced double auction mechanism"
    - "approximately efficient two sided combinatorial auctions"
    - "online truthful mechanisms for multi sided markets"

Connected through hyperedge HE-2 (induced by source paper "muda a truthful multi unit double auction mechanism"):
  with members:
    - "approximating gains from trade in two sided markets via simple mechanisms"
    - "polyhedral clinching auctions for two sided markets"
    - "sbba a strongly budget balanced double auction mechanism"
    - "approximately efficient two sided combinatorial auctions"
    - "envy freedom and prior free mechanism design"

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)