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: "selfishness need not be bad"
  Abstract: This article studies the user selfish behavior in non-atomic congestion games (NCG). We prove that the price of anarchy of general NCGs tends to 1 as number of users tends to infinity. This generalizes a recent result in the literature. Although our result is general, the proof appears simpler. #R##N#For routing games with BPR travel time functions, we prove that every system optimum strategy profile is an $\epsilon$-approximate Nash equilibrium, where $\epsilon$ is a small constant depending on the travel demands. Moreover, we prove that the price of anarchy of these games equal $1+O(T^{-\beta}),$ where $T$ is the total travel demand and $\beta$ is the degree of the BPR functions. This confirms a conjecture proposed by O'Here et al. In addition, we proved that the cost of both, system optimum and Nash equilibrium, depends mainly on the distribution of users among OD pairs, when the total travel time is large. This does not only supply an approximate method for computing these cost, but also give insights how to reduce the total travel time, when the total travel demand is large. #R##N#To empirically verify our theoretical findings, we have taken real traffic data within the 2nd ring road of Beijing as an instance in an experimental study. Our empirical results definitely validate our findings. In addition, they show that the current traffic in Beijing within that area is already far beyond saturation, and no route guidance policy can significantly reduce the total travel time for the current huge total travel demand. #R##N#In summary, selfishness in a congestion game with a large number of users need not be bad. It may be the best choice in a bad environment.

Connected through hyperedge HE-1 (induced by source paper "selfishness need not be bad a general proof"):
  with members:
    - "when is selfish routing bad the price of anarchy in light and heavy traffic"
    - "on the price of anarchy of highly congested nonatomic network games"

Connected through hyperedge HE-2 (induced by source paper "when is selfish routing bad the price of anarchy in light and heavy traffic"):
  with members:
    - "how bad is selfish routing in practice"
    - "on the price of anarchy of highly congested nonatomic network games"

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)