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 "descending price coordinates approximately efficient search"):
  Abstract: When exploring acquisition targets, firms typically begin with the possibilities offering greatest option value and work their way down, as prescribed by optimal search theory. Yet the market designs economists have often prescribed, involving simultaneous or ascending prices, stymie this process. As a result they may be arbitrarily inefficient when one accounts for the costs bidders must invest to learn their value for acquiring different items. We present a model that incorporates such costs, and a simple descending price procedure that we prove robustly approximates the fully optimal sequential search process quite generally. Our results exploit a novel characterization of Weitzman's "Pandora's Box" problem in terms of option pricing theory that connects seamlessly with recent techniques from algorithmic mechanism design.

Includes members:
  Member "price of anarchy for auction revenue":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simple credible and approximately optimal auctions")
  Member "bayesian games and the smoothness framework":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fair allocation of indivisible goods improvement and generalization")
  Member "price of anarchy for greedy auctions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proportional dynamics in exchange economies")

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)