human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "convergence of large atomic congestion games"):
  Abstract: We study the convergence of sequences of atomic unsplittable congestion games with an increasing number of players. We consider two situations. In the first setting, each player has a weight that tends to zero, in which case the mixed equilibria of the finite games converge to the set of Wardrop equilibria of the corresponding nonatomic limit game. In the second case, players have unit weights, but participate in the game with a probability that tends to zero. In this case, the mixed equilibria converge to the set of Wardrop equilibria of another nonatomic game with suitably defined costs, which can be seen as a Poisson game in the sense of Myerson (1998). In both settings we show that the price of anarchy of the sequence of games converges to the price of anarchy of the nonatomic limit. Beyond the case of congestion games, we establish a general result on the convergence of large games with random players towards a Poisson game.

Includes members:
  Member "routing game on parallel networks the convergence of atomic to nonatomic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient estimation of equilibria in large aggregative games with coupling constraints")
  Member "the price of anarchy in large games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "envy freeness up to any item with high nash welfare the virtue of donating items")
  Member "price of anarchy for non atomic congestion games with stochastic demands":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "price of anarchy in stochastic atomic congestion games with affine costs")

Question: Please tell me which class the source paper 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)