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: "optimizing scrip systems efficiency crashes hoarders and altruists"
  Abstract: We discuss the design of efficient scrip systems and develop tools for empirically analyzing them. For those interested in the empirical study of scrip systems, we demonstrate how characteristics of agents in a system can be inferred from the equilibrium distribution of money. From the perspective of a system designer, we examine the effect of the money supply on social welfare and show that social welfare is maximized by increasing the money supply up to the point that the system experiences a ``monetary crash,'' where money is sufficiently devalued that no agent is willing to perform a service. We also examine the implications of the presence of altruists and hoarders on the performance of the system. While a small number of altruists may improve social welfare, too many can also cause the system to experience a monetary crash, which may be bad for social welfare. Hoarders generally decrease social welfare but, surprisingly, they also promote system stability by helping prevent monetary crashes. In addition, we provide new technical tools for analyzing and computing equilibria by showing that our model exhibits strategic complementarities, which implies that there exist equilibria in pure strategies that can be computed efficiently.

Connected through hyperedge HE-1 (induced by source paper "social choice with non quasi linear utilities"):
  with members:
    - "contingent payment mechanisms to maximize resource utilization"
    - "competitive equilibria in two sided matching markets with non transferable utilities"
    - "general auction mechanism for search advertising"

Connected through hyperedge HE-2 (induced by source paper "an equilibrium analysis of scrip systems"):
  with members:
    - "optimizing scrip systems crashes altruists hoarders sybils and collusion"
    - "mean field equilibrium in dynamic games with complementarities"
    - "manipulating scrip systems sybils and collusion"
    - "efficiency and nash equilibria in a scrip system for p2p networks"
    - "random worlds and maximum entropy"

Connected through hyperedge HE-3 (induced by source paper "optimizing scrip systems crashes altruists hoarders sybils and collusion"):
  with members:
    - "an equilibrium analysis of scrip systems"
    - "manipulating scrip systems sybils and collusion"
    - "efficiency and nash equilibria in a scrip system for p2p networks"

Connected through hyperedge HE-4 (induced by source paper "social norm design for information exchange systems with limited observations"):
  with members:
    - "efficiency and nash equilibria in a scrip system for p2p networks"

Connected through hyperedge HE-5 (induced by source paper "designing practical distributed exchange for online communities"):
  with members:
    - "efficiency and nash equilibria in a scrip system for p2p networks"

Connected through hyperedge HE-6 (induced by source paper "designing exchange for online communities"):
  with members:
    - "efficiency and nash equilibria in a scrip system for p2p networks"

Connected through hyperedge HE-7 (induced by source paper "multiagent learning in large anonymous games"):
  with members:
    - "mean field equilibrium in dynamic games with complementarities"
    - "computing equilibria in anonymous games"
    - "efficiency and nash equilibria in a scrip system for p2p networks"
    - "reinforcement learning a survey"

Connected through hyperedge HE-8 (induced by source paper "manipulating scrip systems sybils and collusion"):
  with members:
    - "efficiency and nash equilibria in a scrip system for p2p networks"
    - "random worlds and maximum entropy"

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)