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 "infinite duration bidding games"):
  Abstract: Two-player games on graphs are widely studied in formal methods as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study the {\em bidding} mode of moving the token, which, to the best of our knowledge, has never been studied in infinite-duration games. Both players have separate {\em budgets}, which sum up to $1$. In each turn, a bidding takes place. Both players submit bids simultaneously, and a bid is legal if it does not exceed the available budget. The winner of the bidding pays his bid to the other player and moves the token. For reachability objectives, repeated bidding games have been studied and are called {\em Richman games} \cite{LLPU96,LLPSU99}. There, a central question is the existence and computation of {\em threshold} budgets; namely, a value $t \in [0,1]$ such that if \PO's budget exceeds $t$, he can win the game, and if \PT's budget exceeds $1-t$, he can win the game. We focus on parity games and mean-payoff games. We show the existence of threshold budgets in these games, and reduce the problem of finding them to Richman games. We also determine the strategy-complexity of an optimal strategy. Our most interesting result shows that memoryless strategies suffice for mean-payoff bidding games.

Includes members:
  Member "determinacy in discrete bidding infinite duration games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "infinite duration poorman bidding games")
  Member "infinite duration poorman bidding games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "determinacy in discrete bidding infinite duration games")
  Member "how much lookahead is needed to win infinite games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of transducer synthesis from multi sequential specifications")
  Member "discrete all pay bidding games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "determinacy in discrete bidding infinite duration games")
  Member "non zero sum games for reactive synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "games where you can play optimally with finite memory")
  Member "pure nash equilibria in concurrent deterministic games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "nash equilibrium and bisimulation invariance")
  Member "variations on the stochastic shortest path problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "life is random time is not markov decision processes with window objectives")

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.LO(Logic in Computer Science)