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 "deciding maxmin reachability in half blind stochastic games"):
  Abstract: Two-player, turn-based, stochastic games with reachability conditions are considered, where the maximizer has no information (he is blind) and is restricted to deterministic strategies whereas the minimizer is perfectly informed. We ask the question of whether the game has maxmin 1, in other words we ask whether for all $\epsilon>0$ there exists a deterministic strategy for the (blind) maximizer such that against all the strategies of the minimizer, it is possible to reach the set of final states with probability larger than $1-\epsilon$. This problem is undecidable in general, but we define a class of games, called leaktight half-blind games where the problem becomes decidable. We also show that mixed strategies in general are stronger for both players and that optimal strategies for the minimizer might require infinite-memory.

Includes members:
  Member "profinite techniques for probabilistic automata and the optimality of the markov monoid algorithm":
    also connected through other hyperedges:
      (none)
  Member "deciding the value 1 problem for probabilistic leaktight automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "profinite techniques for probabilistic automata and the markov monoid algorithm")
  Member "the complexity of partial observation stochastic parity games with finite memory strategies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure control under partial observability with temporal logic constraints")
  Member "regular cost functions part i logic and algebra over words":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "intersection types for unboundedness problems")
  Member "decidable problems for probabilistic automata on infinite words":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of pomdps with long run average objectives")
  Member "power of randomization in automata on infinite strings":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of pomdps with long run average objectives")
  Member "partial observation stochastic games how to win when belief fails":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "alternating tree automata with qualitative semantics")

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)