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: "bounding rationality by discounting time"
  Abstract: Consider a game where Alice generates an integer and Bob wins if he can factor that integer. Traditional game theory tells us that Bob will always win this game even though in practice Alice will win given our usual assumptions about the hardness of factoring. #R##N#We define a new notion of bounded rationality, where the payoffs of players are discounted by the computation time they take to produce their actions. We use this notion to give a direct correspondence between the existence of equilibria where Alice has a winning strategy and the hardness of factoring. Namely, under a natural assumption on the discount rates, there is an equilibriumwhere Alice has a winning strategy iff there is a linear-time samplable distribution with respect to which Factoring is hard on average. #R##N#We also give general results for discounted games over countable action spaces, including showing that any game with bounded and computable payoffs has an equilibrium in our model, even if each player is allowed a countable number of actions. It follows, for example, that the Largest Integer game has an equilibrium in our model though it has no Nash equilibria or epsilon-Nash equilibria.

Connected through hyperedge HE-1 (induced by source paper "plausibility and probability in deductive reasoning"):
  with members:
    - "a nearly tight sum of squares lower bound for the planted clique problem"
    - "optimal polynomial time estimators a bayesian notion of approximation algorithm"
    - "toward idealized decision theory"
    - "algorithmic rationality game theory with costly computation"
    - "dealing with logical omniscience expressiveness and pragmatics"
    - "average case complexity"

Connected through hyperedge HE-2 (induced by source paper "on the implications of lookahead search in game playing"):
  with members:
    - "on the complexity of nash dynamics and sink equilibria"
    - "convergence to equilibrium in local interaction games and ising models"
    - "distributed selfish load balancing"

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

Connected through hyperedge HE-4 (induced by source paper "bounded rationality strategy simplification and equilibrium"):
  with members:
    - "game theory with costly computation"
    - "bundling equilibrium in combinatorial auctions"

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)