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 "balancing the robustness and convergence of tatonnement"):
  Abstract: A major goal in Algorithmic Game Theory is to justify equilibrium concepts from an algorithmic and complexity perspective. One appealing approach is to identify robust natural distributed algorithms that converge quickly to an equilibrium. This paper addresses a lack of robustness in existing convergence results for discrete forms of tatonnement, including the fact that it need not converge when buyers have linear utility functions. This work achieves greater robustness by seeking approximate rather than exact convergence in large market settings. #R##N#More specifically, this paper shows that for Fisher markets with buyers having CES utility functions, including linear utility functions, tatonnement will converge quickly to an approximate equilibrium (i.e. at a linear rate), modulo a suitable large market assumption. The quality of the approximation is a function of the parameters of the large market assumption.

Includes members:
  Member "a strongly polynomial algorithm for linear exchange markets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "proportional dynamics in exchange economies")
  Member "tracing equilibrium in dynamic markets via distributed adaptation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "proportional dynamics in exchange economies")
  Member "amortized analysis of asynchronous price dynamics":
    also connected through other hyperedges:
      (none)
  Member "dynamics of distributed updating in fisher markets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proportional dynamics in exchange economies")
  Member "tatonnement in ongoing markets of complementary goods":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proportional dynamics in exchange economies")
  Member "the complexity of non monotone markets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "consenus halving does it ever get easier")
  Member "a combinatorial polynomial algorithm for the linear arrow debreu market":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "proportional dynamics in exchange economies")
  Member "settling the complexity of arrow debreu equilibria in markets with additively separable utilities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of interactively learning a stable matching by trial and error")

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)