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 "from hotelling to load balancing approximation and the principle of minimum differentiation"):
  Abstract: Competing firms tend to select similar locations for their stores. This phenomenon, called the principle of minimum differentiation, was captured by Hotelling with a landmark model of spatial competition but is still the object of an ongoing scientific debate. Although consistently observed in practice, many more realistic variants of Hotelling's model fail to support minimum differentiation or do not have pure equilibria at all. In particular, it was recently proven for a generalized model which incorporates negative network externalities and which contains Hotelling's model and classical selfish load balancing as special cases, that the unique equilibria do not adhere to minimum differentiation. Furthermore, it was shown that for a significant parameter range pure equilibria do not exist. We derive a sharp contrast to these previous results by investigating Hotelling's model with negative network externalities from an entirely new angle: approximate pure subgame perfect equilibria. This approach allows us to prove analytically and via agent-based simulations that approximate equilibria having good approximation guarantees and that adhere to minimum differentiation exist for the full parameter range of the model. Moreover, we show that the obtained approximate equilibria have high social welfare.

Includes members:
  Member "shapley facility location games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hotelling games with random tolerance intervals")
  Member "hotelling downs model with limited attraction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hotelling games with random tolerance intervals")
  Member "location games on networks existence and efficiency of equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the buck passing game")
  Member "on voting and facility location":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "selecting voting locations for fun and profit")
  Member "voronoi game on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on re balancing self interested agents in ride sourcing transportation networks")
  Member "on the power of deterministic mechanisms for facility location games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "facility location problem with capacity constraints algorithmic and mechanism design perspectives")
  Member "nash equilibria in voronoi games on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "complexity of equilibrium in diffusion games on social networks")

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)