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: "penalty bidding mechanisms for allocating resources and overcoming present bias"
  Abstract: From skipped exercise classes to last-minute cancellation of dentist appointments, underutilization of reserved resources abounds, arising from uncertainty about the future and further exacerbated by present bias -- the constant struggle between our current and future selves. The contingent second price mechanism proposed by Ma et al. 2019 provably optimizes utilization, but relies on the assumption that agents rationally optimize their expected utility, and fails to be incentive compatible when agents are present-biased. In this paper, we unite resource allocation and commitment devices through the design of contingent payment mechanisms. We propose the two-bid penalty-bidding mechanism, which assigns the resources to agents who are willing to accept the highest no-show penalties, determines a market-clearing penalty level, but allows each assigned agent to increase her own penalty in order to better counter her present bias. We prove the existence of a simple dominant strategy equilibrium, regardless of an agent's level of present bias or degree of "sophistication" (the ability to forecast the change in one's future preferences). Via simulations, we show that the proposed mechanism not only improves utilization, but also achieves higher social welfare than mechanisms that are welfare-optimal for settings without present bias.

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)