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 "on the nisan ronen conjecture for submodular valuations"):
  Abstract: We consider incentive compatible mechanisms for a domain that is very close to the domain of scheduling $n$ unrelated machines: the single exception is that the valuation of just one machine is submodular. For the scheduling problem with such cost functions, we give a lower bound of $\Omega(\sqrt{n})$ on the approximation ratio of incentive compatible deterministic mechanisms. This is a strong information-theoretic impossibility result on the approximation ratio of mechanisms on relatively simple domains. The lower bound of the current work assumes no restriction on the mechanism side, but an expanded class of valuations, in contrast to previous general results on the Nisan-Ronen conjecture that hold for only special classes of mechanisms such as local, strongly monotone, and anonymous mechanisms. Our approach is based on a novel characterization of appropriately selected smaller instances that allows us to focus on particular type of algorithms (linear mechanisms), from which we extract a locality property that gives the lower bound.

Includes members:
  Member "no truthful mechanism can be better than n approximate for two natural problems":
    also connected through other hyperedges:
      (none)
  Member "breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "setting lower bounds on truthfulness":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "envy regret and social welfare loss")
  Member "the vcg mechanism for bayesian scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal pricing for mhr and lambda regular distributions")
  Member "bayesian truthful mechanisms for job scheduling from bi criterion approximation algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "persuasion and incentives through the lens of duality")
  Member "copula based randomized mechanisms for truthful scheduling on two unrelated machines":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "setting lower bounds on truthfulness")
  Member "a unified approach to truthful scheduling on related machines":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the vcg mechanism for bayesian scheduling")
  Member "multi unit auctions beyond roberts":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "walrasian dynamics in multi unit markets")

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)