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 "ascending price algorithms for unknown markets"):
  Abstract: We design a simple ascending-price algorithm to compute a $(1+\varepsilon)$-approximate equilibrium in Arrow-Debreu exchange markets with weak gross substitute (WGS) property, which runs in time polynomial in market parameters and $\log 1/\varepsilon$. This is the first polynomial-time algorithm for most of the known tractable classes of Arrow-Debreu markets, which is easy to implement and avoids heavy machinery such as the ellipsoid method. In addition, our algorithm can be applied in unknown market setting without exact knowledge about the number of agents, their individual utilities and endowments. Instead, our algorithm only relies on queries to a global demand oracle by posting prices and receiving aggregate demand for goods as feedback. When demands are real-valued functions of prices, the oracles can only return values of bounded precision based on real utility functions. Due to this more realistic assumption, precision and representation of prices and demands become a major technical challenge, and we develop new tools and insights that may be of independent interest. Furthermore, our approach also gives the first polynomial-time algorithm to compute an exact equilibrium for markets with spending constraint utilities, a piecewise linear concave generalization of linear utilities. This resolves an open problem posed by Duan and Mehlhorn (2015).

Includes members:
  Member "approximating the nash social welfare with budget additive valuations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efx exists for three agents")
  Member "convex program duality fisher markets and nash social welfare":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "nash social welfare for indivisible items under separable piecewise linear concave utilities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efx exists for three agents")
  Member "an improved combinatorial polynomial algorithm for the linear arrow debreu market":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proportional dynamics in exchange economies")
  Member "convergence of tâtonnement in fisher markets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "proportional dynamics in exchange economies")
  Member "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dynamic weighted fairness with minimal disruptions")
  Member "a rational convex program for linear arrow debreu markets":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "proportional dynamics in exchange economies")
  Member "tatonnement in ongoing markets of complementary goods":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)