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 "interpolating between truthful and non truthful mechanisms for combinatorial auctions"):
  Abstract: We study the communication complexity of combinatorial auctions via interpolation mechanisms that interpolate between non-truthful and truthful protocols. Specifically, an interpolation mechanism has two phases. In the first phase, the bidders participate in some non-truthful protocol whose output is itself a truthful protocol. In the second phase, the bidders participate in the truthful protocol selected during phase one. Note that virtually all existing auctions have either a non-existent first phase (and are therefore truthful mechanisms), or a non-existent second phase (and are therefore just traditional protocols, analyzed via the Price of Anarchy/Stability). #R##N#The goal of this paper is to understand the benefits of interpolation mechanisms versus truthful mechanisms or traditional protocols, and develop the necessary tools to formally study them. Interestingly, we exhibit settings where interpolation mechanisms greatly outperform the optimal traditional and truthful protocols. Yet, we also exhibit settings where interpolation mechanisms are provably no better than truthful ones. Finally, we apply our new machinery to prove that the recent single-bid mechanism of Devanur et. al.~\cite{DevanurMSW15} (the only pre-existing interpolation mechanism in the literature) achieves the optimal price of anarchy among a wide class of protocols, a claim that simply can't be addressed by appealing just to machinery from communication complexity or the study of truthful mechanisms.

Includes members:
  Member "on the complexity of computing an equilibrium in combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on simultaneous two player combinatorial auctions")
  Member "inapproximability of truthful mechanisms via generalizations of the vc dimension":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "clinching auctions beyond hard budget constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polyhedral clinching auctions for two sided markets")
  Member "price of anarchy for auction revenue":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simple credible and approximately optimal auctions")
  Member "on the efficiency of the walrasian mechanism":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the pareto frontier of inefficiency in mechanism design")
  Member "expressiveness and robustness of first price position auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a note on the efficiency of position mechanisms with budget constraints")
  Member "the computational complexity of truthfulness in combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "bayesian sequential auctions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "online submodular welfare maximization greedy beats 1 2 in random order")

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)