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 "cooperative equilibrium a solution predicting cooperative play"):
  Abstract: Nash equilibrium (NE) assumes that players always make a best response. However, this is not always true; sometimes people cooperate even it is not a best response to do so. For example, in the Prisoner's Dilemma, people often cooperate. Are there rules underlying cooperative behavior? In an effort to answer this question, we propose a new equilibrium concept: perfect cooperative equilibrium (PCE), and two related variants: max-PCE and cooperative equilibrium. PCE may help explain players' behavior in games where cooperation is observed in practice. A player's payoff in a PCE is at least as high as in any NE. However, a PCE does not always exist. We thus consider {\alpha}-PCE, where {\alpha} takes into account the degree of cooperation; a PCE is a 0-PCE. Every game has a Pareto-optimal max-PCE (M-PCE); that is, an {\alpha}-PCE for a maximum {\alpha}. We show that M-PCE does well at predicting behavior in quite a few games of interest. We also consider cooperative equilibrium (CE), another generalization of PCE that takes punishment into account. Interestingly, all Pareto-optimal M-PCE are CE. We prove that, in 2-player games, a PCE (if it exists), a M-PCE, and a CE can all be found in polynomial time using bilinear programming. This is a contrast to Nash equilibrium, which is PPAD complete even in 2-player games [Chen, Deng, and Teng 2009]. We compare M-PCE to the coco value [Kalai and Kalai 2009], another solution concept that tries to capture cooperation, both axiomatically and in terms of an algebraic characterization, and show that the two are closely related, despite their very different definitions.

Includes members:
  Member "translucent players explaining cooperative behavior in social dilemmas":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "perfect prediction in minkowski spacetime perfectly transparent equilibrium for dynamic games with imperfect information")
  Member "game theory with translucent players":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "perfect prediction in minkowski spacetime perfectly transparent equilibrium for dynamic games with imperfect information")

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)