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 "price of anarchy in stochastic atomic congestion games with affine costs"):
  Abstract: We consider atomic congestion games with stochastic demands. The game captures the fact that players may end up not being able to participate. Participation happens independently and with exogenous probabilities $\proba_{\play}\in[0,1]$ that are common knowledge. Conversely, exclusion happens with probability $1-\proba_{\play}$, in which case players incur no cost. We prove that this is a potential game, and that the \acl{PoA} parameterized by the probabilities is a nondecreasing function of $\proba=\max_{\play} \proba_{\play}$. The worst case is attained for players with the same probabilities $\proba_{\play}\equiv \proba$. In the case of affine costs we provide an analytic expression for the parameterized \acl{PoA} as a function of $\proba$. This function is continuous on $(0,1]$, it is equal to $4/3$ for $0<\proba\leq 1/4$, and increases towards the known atomic bound of $5/2$ when $\proba\to 1$. The result follows using the $(\lambda,\mu)$-smoothness framework and optimizing the parameters to get sharp bounds. We show that these bounds are tight and are attained on routing games with purely linear costs (i.e., without constant terms). Additionally, we derive tight bounds for the \acl{PoS} for all values of $\proba\in [0,1]$.

Includes members:
  Member "tight inefficiency bounds for perception parameterized affine congestion games":
    also connected through other hyperedges:
      (none)
  Member "price of anarchy for non atomic congestion games with stochastic demands":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convergence of large atomic congestion games")

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)