human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "extending finite memory determinacy general techniques and an application to energy parity games"
  Abstract: We provide several techniques to extend finite memory determinacy from some restricted class of games played on a finite graph to a larger class. As a particular example, we study energy parity games. #R##N#First we show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding class of multi-player multi-outcome games. This generalizes a previous result by Brihaye, De Pril and Schewe. #R##N#Then we investigate adding additional constraints to the winning conditions, in a way that generalizes the move from parity to bounded energy parity games. We prove that under some conditions, this preserves finite memory determinacy. We show that bounded energy parity games and unbounded energy parity games are equivalent, and thus obtain a new proof of finite memory determinacy for energy parity games. Our proof yields significantly improved bounds on the memory required compared to the original one by Chatterjee and Doyen. We then apply our main theorem to show that multi-player multi-outcome energy parity games have finite memory Nash equilibria. #R##N#Our proofs are generally constructive, that is, provide upper bounds for the memory required, as well as algorithms to compute the relevant winning strategies.

Connected through hyperedge HE-1 (induced by source paper "extending finite memory determinacy to multiplayer games"):
  with members:
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "infinite sequential games with real valued payoffs"
    - "weihrauch degrees of finding equilibria in sequential games"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "parity and streett games with costs"
    - "the complexity of multi mean payoff and multi energy games"
    - "multiplayer cost games with simple nash equilibria"
    - "energy parity games"

Question: Please tell me which class the center node 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)