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 "obvious strategyproofness needs monitoring for good approximations"):
  Abstract: Obvious strategyproofness (OSP) is an appealing concept as it allows to maintain incentive compatibility even in the presence of agents that are not fully rational, e.g., those who struggle with contingent reasoning [Li, 2015]. However, it has been shown to impose some limitations, e.g., no OSP mechanism can return a stable matching [Ashlagi and Gonczarowski, 2015]. #R##N#We here deepen the study of the limitations of OSP mechanisms by looking at their approximation guarantees for basic optimization problems paradigmatic of the area, i.e., machine scheduling and facility location. We prove a number of bounds on the approximation guarantee of OSP mechanisms, which show that OSP can come at a significant cost. However, rather surprisingly, we prove that OSP mechanisms can return optimal solutions when they use monitoring -- a novel mechanism design paradigm that introduces a mild level of scrutiny on agents' declarations [Kovacs et al., 2015].

Includes members:
  Member "gibbard satterthwaite success stories and obvious strategyproofness":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probabilistic verification for obviously strategyproof mechanisms")
  Member "no stable matching mechanism is obviously strategy proof":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistic verification for obviously strategyproof mechanisms")
  Member "a simple and approximately optimal mechanism for an additive buyer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a permutation equivariant neural network architecture for auction design")
  Member "the computational complexity of truthfulness in combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "on the power of deterministic mechanisms for facility location games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "from hotelling to load balancing approximation and the principle of minimum differentiation")
  Member "a deterministic truthful ptas for scheduling related machines":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the nisan ronen conjecture for submodular valuations")

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)