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 "randomness for free"):
  Abstract: We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (players interact simultaneously); and (b) turn-based (players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. We present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function (probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games.

Includes members:
  Member "pomdps under probabilistic semantics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameter independent strategies for pmdps via pomdps")
  Member "what is decidable about partially observable markov decision processes with omega regular objectives":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "point based methods for model checking in partially observable markov decision processes")
  Member "partial observation stochastic games how to win when belief fails":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "alternating tree automata with qualitative semantics")
  Member "qualitative concurrent stochastic games with imperfect information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "alternating tree automata with qualitative semantics")
  Member "algorithms for omega regular games with imperfect information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "alternating tree automata with qualitative semantics")
  Member "interactive small step algorithms ii abstract state machines and the characterization theorem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "qualitative analysis of concurrent mean payoff games")

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)