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: "implementation without commitment in moral hazard environments"
  Abstract: I define a solution concept for strategic form games called interdependent-choice equilibrium. It is an extension of correlated equi- librium, in which the mediator is able to choose the timing of his signals and observe the actions taken by the players. The set of interdependent- choice equilibria is nonempty and is given by a finite set of affine inequal- ities. It characterizes all the outcomes that can be implemented in single shot interactions without the use of binding contracts or any other form of delegation. The results can also be interpreted as robust predictions for environments in which the rules of the game (e.g. order of play and information structure) are unknown.

Connected through hyperedge HE-1 (induced by source paper "translucent players explaining cooperative behavior in social dilemmas"):
  with members:
    - "algorithmic rationality game theory with costly computation"
    - "group size effect on cooperation in social dilemmas"
    - "benevolent characteristics promote cooperative behaviour among humans"
    - "heuristics guide the implementation of social preferences in one shot prisoner s dilemma experiments"
    - "a model of human cooperation in social dilemmas"
    - "game theory with translucent players"

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)