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 "economic efficiency requires interaction"):
  Abstract: We study the necessity of interaction between individuals for obtaining approximately efficient allocations. The role of interaction in markets has received significant attention in economic thinking, e.g. in Hayek's 1945 classic paper. #R##N#We consider this problem in the framework of simultaneous communication complexity. We analyze the amount of simultaneous communication required for achieving an approximately efficient allocation. In particular, we consider two settings: combinatorial auctions with unit demand bidders (bipartite matching) and combinatorial auctions with subadditive bidders. For both settings we first show that non-interactive systems have enormous communication costs relative to interactive ones. On the other hand, we show that limited interaction enables us to find approximately efficient allocations.

Includes members:
  Member "on simultaneous two player combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "combinatorial auctions do need modest interaction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "computational efficiency requires simple taxation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "welfare maximization with limited interaction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  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 "the computational complexity of truthfulness in combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "better bounds for matchings in the streaming model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "two player hidden pointer chasing and multi pass lower bounds in turnstile streams")
  Member "simultaneous auctions are almost efficient":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "complexity theory game theory and economics the barbados lectures")

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)