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 "the complexity of ergodic mean payoff games"):
  Abstract: We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergodic games are as follows: We establish (1) an optimal exponential bound on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy); (2) the approximation problem lie in FNP; (3) the approximation problem is at least as hard as the decision problem for simple stochastic games (for which NP intersection coNP is the long-standing best known bound). We present a variant of the strategy-iteration algorithm by Hoffman and Karp; show that both our algorithm and the classical value-iteration algorithm can approximate the value in exponential time; and identify a subclass where the value-iteration algorithm is a FPTAS. We also show that the exact value can be expressed in the existential theory of the reals, and establish square-root sum hardness for a related class of games.

Includes members:
  Member "exact algorithms for solving stochastic games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "acceptable strategy profiles in stochastic games")
  Member "an exponential lower bound for the latest deterministic strategy iteration algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a parity game tale of two counters")
  Member "solving simple stochastic games with few coin toss positions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "solving simple stochastic games with few random nodes faster using bland s rule")
  Member "the complexity of solving reachability games using value and strategy iteration":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reachability for branching concurrent stochastic games")
  Member "exponential lower bounds for policy iteration":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a universal attractor decomposition algorithm for parity games")
  Member "recursive concurrent stochastic games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "how good is a strategy in a game with nature")
  Member "stochastic limit average games are in exptime":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ergodic mean payoff games for the analysis of attacks in crypto currencies")

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)