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 "translucent players explaining cooperative behavior in social dilemmas"):
  Abstract: In the last few decades, numerous experiments have shown that humans do not always behave so as to maximize their material payoff. Cooperative behavior when non-cooperation is a dominant strategy (with respect to the material payoffs) is particularly puzzling. Here we propose a novel approach to explain cooperation, assuming what Halpern and Pass (2013) call "translucent players". Typically, players are assumed to be "opaque", in the sense that a deviation by one player does not affect the strategies used by other players. But a player may believe that if he switches from one strategy to another, the fact that he chooses to switch may be visible to the other players. For example, if he chooses to defect in Prisoner's Dilemma, the other player may sense his guilt. We show that by assuming translucent players, we can recover many of the regularities observed in human behavior in well-studied games such as Prisoner's Dilemma, Traveler's Dilemma, Bertrand Competition, and the Public Goods game.

Includes members:
  Member "algorithmic rationality game theory with costly computation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sok tools for game theoretic models of security for cryptocurrencies")
  Member "group size effect on cooperation in social dilemmas":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "benevolent characteristics promote cooperative behaviour among humans")
  Member "benevolent characteristics promote cooperative behaviour among humans":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cooperative equilibrium beyond social dilemmas pareto solvable games")
  Member "heuristics guide the implementation of social preferences in one shot prisoner s dilemma experiments":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cooperation in the spatial prisoner s dilemma game with probabilistic abstention")
  Member "a model of human cooperation in social dilemmas":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a game theoretic analysis of the social impact of connected and automated vehicles")
  Member "implementation without commitment in moral hazard environments":
    also connected through other hyperedges:
      (none)
  Member "game theory with translucent players":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)