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: "game theory with costly computation"
  Abstract: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic results (such as the existence of a Nash equilibrium) no longer hold. Nevertheless, we can use the framework to provide psychologically appealing explanations to observed behavior in well-studied games (such as finitely repeated prisoner's dilemma and rock-paper-scissors). Furthermore, we provide natural conditions on games sufficient to guarantee that equilibria exist. As an application of this framework, we consider a notion of game-theoretic implementation of mediators in computational games. We show that a special case of this notion is equivalent to a variant of the traditional cryptographic definition of protocol security; this result shows that, when taking computation into account, the two approaches used for dealing with "deviating" players in two different communities -- Nash equilibrium in game theory and zero-knowledge "simulation" in cryptography -- are intimately related.

Connected through hyperedge HE-1 (induced by source paper "sok tools for game theoretic models of security for cryptocurrencies"):
  with members:
    - "oceanic games centralization risks and incentives in blockchain mining"
    - "a survey on consensus mechanisms and mining strategy management in blockchain networks"
    - "selfish mining in ethereum"
    - "impossibility of full decentralization in permissionless blockchains"
    - "squirrl automating attack discovery on blockchain incentive mechanisms with deep reinforcement learning"
    - "an axiomatic approach to block rewards"
    - "reward sharing schemes for stake pools"
    - "compounding of wealth in proof of stake cryptocurrencies"

Connected through hyperedge HE-2 (induced by source paper "algorithmic rationality game theory with costly computation"):
  with members:
    - "reasoning about beliefs and actions under computational resource constraints"
    - "i don t want to think about it now decision theory with costly computation"
    - "extensive games with possibly unaware players"

Connected through hyperedge HE-3 (induced by source paper "decision theory with resource bounded agents"):
  with members:
    - "algorithmic rationality game theory with costly computation"
    - "reasoning about beliefs and actions under computational resource constraints"
    - "i don t want to think about it now decision theory with costly computation"
    - "provably bounded optimal agents"

Connected through hyperedge HE-4 (induced by source paper "i don t want to think about it now decision theory with costly computation"):
  with members:
    - "graphical models for preference and utility"
    - "reasoning about beliefs and actions under computational resource constraints"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"

Connected through hyperedge HE-5 (induced by source paper "quantifying shannon s work function for cryptanalytic attacks"):
  with members:
    - "in the beginning was game semantics"
    - "quantifying resource use in computations"
    - "beyond nash equilibrium solution concepts for the 21st century"
    - "a public key block cipher based on multivariate quadratic quasigroups"
    - "a generic attack to ciphers"
    - "theoretical cryptanalysis of the klimov shamir number generator tf 1"
    - "computability logic a formal theory of interaction"

Connected through hyperedge HE-6 (induced by source paper "sequential rationality in cryptographic protocols"):
  with members:
    - "algorithmic rationality game theory with costly computation"
    - "bounding rationality by discounting time"
    - "rational secret sharing and multiparty computation extended abstract"

Connected through hyperedge HE-7 (induced by source paper "bounded rationality strategy simplification and equilibrium"):
  with members:
    - "bounding rationality by discounting time"
    - "bundling equilibrium in combinatorial auctions"

Connected through hyperedge HE-8 (induced by source paper "beyond nash equilibrium solution concepts for the 21st century"):
  with members:
    - "i don t want to think about it now decision theory with costly computation"
    - "iterated regret minimization a more realistic solution concept"
    - "optimizing scrip systems efficiency crashes hoarders and altruists"
    - "lower bounds on implementing robust and resilient mediators"
    - "extensive games with possibly unaware players"
    - "rational secret sharing and multiparty computation extended abstract"
    - "interactive unawareness revisited"
    - "a computer scientist looks at game theory"

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)