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 "expected window mean payoff"):
  Abstract: In the window mean-payoff objective, given an infinite path, instead of considering a long run average, we consider the minimum payoff that can be ensured at every position of the path over a finite window that slides over the entire path. Chatterjee et al. studied the problem to decide if in a two-player game, Player 1 has a strategy to ensure a window mean-payoff of at least 0. #R##N#In this work, we consider a function that given a path returns the supremum value of the window mean-payoff that can be ensured over the path and we show how to compute its expected value in Markov chains and Markov decision processes. We consider two variants of the function: Fixed window mean-payoff in which a fixed window length $l_{max}$ is provided; and Bounded window mean-payoff in which we compute the maximum possible value of the window mean-payoff over all possible window lengths. Further, for both variants, we consider (i) a direct version of the problem where for each path, the payoff that can be ensured from its very beginning and (ii) a non-direct version that is the prefix independent counterpart of the direct version of the problem.

Includes members:
  Member "stability in graphs and games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "on the complexity of heterogeneous multidimensional quantitative games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "looking at mean payoff through foggy windows":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "the complexity of the kth largest subset problem and related problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient quantile computation in markov chains via counting problems for parikh images")
  Member "trading performance for stability in markov decision processes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "looking at mean payoff and total payoff through windows":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "games where you can play optimally with finite memory")

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)