human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent groups of papers sharing a common citing paper.

Details of the hypergraph:
Center node: "Optimality and Domination in Repeated Games with Bounded Players"
  Abstract: We examine questions of optimality and domination in repeated stage games where one or both players may draw their strategies only from (perhaps different) computationally bounded sets. We also consider optimality and domination when bounded convergence rates of the infinite payoff. We develop a notion of a "grace period" to handle the problem of vengeful strategies.

Connected through hyperedge HE-1 (induced by source paper "Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries"):
  with members:
    - "A Competitive Approach to Game Learning"
    - "Planning and Learning in an Adversarial Robotic Game"
    - "Exactly Learning Automata with Small Cover Time"
    - "The Power of a Pebble: Exploring and Mapping Directed Graphs"

Question: Please tell me which class the center node belongs to. The 7 classes are: Neural_Networks, Reinforcement_Learning, Probabilistic_Methods, Theory, Genetic_Algorithms, Case_Based, Rule_Learning. Directly output the class name.

gpt: Theory