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 "on existence and properties of approximate pure nash equilibria in bandwidth allocation games"):
  Abstract: In bandwidth allocation games (BAGs), the strategy of a player consists of various demands on different resources. The player’s utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a limited capacity and if it is exceeded by the total demand, it has to be split between the players. Since these games generally do not have pure Nash equilibria, we consider approximate pure Nash equilibria, in which no player can prove her utility by more than some fixed factor \({\alpha }\) through unilateral strategy changes. There is a threshold \({\alpha }_{\delta }\) (where \(\delta \) is a parameter that limits the demand of each player on a specific resource) such that \({\alpha }\)-approximate pure Nash equilibria always exist for \(\alpha \ge \alpha _\delta \), but not for \(\alpha < \alpha _\delta \). We give both upper and lower bounds on this threshold \(\alpha _\delta \) and show that the corresponding decision problem is \(\mathsf{NP}\)-hard. We also show that the \(\alpha \)-approximate price of anarchy for BAGs is \(\alpha +1\). For a restricted version of the game, where demands of players only differ slightly from each other (e.g. symmetric games), we show that approximate Nash equilibria can be reached (and thus also be computed) in polynomial time using the best-response dynamic. Finally, we show that a broader class of utility-maximization games (which includes BAGs) converges quickly towards states whose social welfare is close to the optimum.

Includes members:
  Member "budget restricted utility games with ordered strategic decisions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "price of fairness for allocating a bounded resource")
  Member "assignment games with conflicts price of total anarchy and convergence results via semi smoothness":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximate equilibrium and incentivizing social coordination")
  Member "efficient computation of approximate pure nash equilibria in congestion games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "existence and complexity of approximate equilibria in weighted congestion games")
  Member "approximate pure nash equilibria in weighted congestion games existence efficient computation and structure":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "existence and complexity of approximate equilibria in weighted congestion games")
  Member "dynamics of profit sharing games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate equilibrium and incentivizing social coordination")
  Member "congestion games with variable demands":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pricing in resource allocation games based on lagrangean duality and convexification")
  Member "on the performance of approximate equilibria in congestion games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "existence and complexity of approximate equilibria in weighted 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)