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 value 1 problem under finite memory strategies for concurrent mean payoff games"):
  Abstract: We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the long-run average of the rewards. The value is the maximal expected payoff that player 1 can guarantee against all strategies of player 2. We consider the computation of the set of states with value 1 under finite-memory strategies for player 1, and our main results for the problem are as follows: (1) we present a polynomial-time algorithm; (2) we show that whenever there is a finite-memory strategy, there is a stationary strategy that does not need memory at all; and (3) we present an optimal bound (which is double exponential) 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).

Includes members:
  Member "qualitative analysis of concurrent mean payoff games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantitative analysis of smart contracts")
  Member "decidable problems for probabilistic automata on infinite words":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of pomdps with long run average objectives")
  Member "the complexity of solving reachability games using value and strategy iteration":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reachability for branching concurrent stochastic games")
  Member "one counter markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stochastic shortest paths and weight bounded properties in markov decision processes")
  Member "recursive concurrent stochastic games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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)