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 "reconciling rationality and stochasticity rich behavioral models in two player games"):
  Abstract: Two traditional paradigms are often used to describe the behavior of agents in multi-agent complex systems. In the first one, agents are considered to be fully rational and systems are seen as multi-player games. In the second one, agents are considered to be fully stochastic processes and the system itself is seen as a large stochastic process. From the standpoint of a particular agent - having to choose a strategy, the choice of the paradigm is crucial: the most adequate strategy depends on the assumptions made on the other agents. #R##N#In this paper, we focus on two-player games and their application to the automated synthesis of reliable controllers for reactive systems - a field at the crossroads between computer science and mathematics. In this setting, the reactive system to control is a player, and its environment is its opponent, usually assumed to be fully antagonistic or fully stochastic. We illustrate several recent developments aiming to breach this narrow taxonomy by providing formal concepts and mathematical frameworks to reason about richer behavioral models. #R##N#The interest of such models is not limited to reactive system synthesis but extends to other application fields of game theory. The goal of our contribution is to give a high-level presentation of key concepts and applications, aimed at a broad audience. To achieve this goal, we illustrate those rich behavioral models on a classical challenge of the everyday life: planning a journey in an uncertain environment.

Includes members:
  Member "average energy games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "games where you can play optimally with finite memory")
  Member "non zero sum games for reactive synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "games where you can play optimally with finite memory")
  Member "variations on the stochastic shortest path problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reinforcement learning of risk constrained policies in markov decision processes")
  Member "the odds of staying on budget":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "life is random time is not markov decision processes with window objectives")
  Member "percentile queries in multi dimensional 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 "expectations or guarantees i want it all a crossroad between games and mdps":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "non zero sum games for reactive synthesis")
  Member "computing quantiles in markov reward models":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "conditional value at risk for reachability and mean payoff in markov decision processes")
  Member "meet your expectations with guarantees beyond worst case synthesis in quantitative games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)