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: "incentivizing efficient use of shared infrastructure optimal tolls in congestion games"
  Abstract: Throughout modern society, human users interact with large-scale engineered systems, e.g., road-traffic networks, electric power grids, wireless communication networks. As the performance of such systems greatly depends on the decisions made by the individual users - often leading to undesirable system behaviour - a natural question arises: How can we design incentives to promote efficient use of the existing infrastructure? Here, we answer this question in relation to the well-studied class of congestion games, used to model a variety of problems arising in theory and practice including traffic routing. In this context, a methodology for designing efficient mechanisms is so far missing, in spite of the vast scientific interest. In this manuscript, we resolve this problem by means of an elegant and computationally tractable approach, recovering and generalizing many results in the literature. Surprisingly, optimal mechanisms designed using local information perform closely to those designed using global information. Additionally, we show how mechanisms that perform optimally in the continuous-flow approximation (marginal cost tolls), worsen the performance when applied to the original discrete setup.

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)