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 "hotelling games with random tolerance intervals"):
  Abstract: The classical Hotelling game is played on a line segment whose points represent uniformly distributed clients. The $n$ players of the game are servers who need to place themselves on the line segment, and once this is done, each client gets served by the player closest to it. The goal of each player is to choose its location so as to maximize the number of clients it attracts. #R##N#In this paper we study a variant of the Hotelling game where each client $v$ has a tolerance interval, randomly distributed according to some density function $f$, and $v$ gets served by the nearest among the players eligible for it, namely, those that fall within its interval. (If no such player exists, then $v$ abstains.) It turns out that this modification significantly changes the behavior of the game and its states of equilibria. In particular, it may serve to explain why players sometimes prefer to "spread out", rather than to cluster together as dictated by the classical Hotelling game. #R##N#We consider two variants of the game: symmetric games, where clients have the same tolerance range to their left and right, and asymmetric games, where the left and right ranges of each client are determined independently of each other. We fully characterize the Nash equilibria of the 2-player game. For at least 3 players, we characterize a specific class of strategy profiles, referred to as canonical profiles, and show that these profiles are the only ones that may yield Nash equilibria in our game. Moreover, the canonical profile, if exists, is uniquely defined for every $n$ and $f$. In both the symmetric and asymmetric setting, we give necessary and sufficient conditions for the canonical profile to be a Nash equilibrium, and demonstrate their application for several distributions.

Includes members:
  Member "from hotelling to load balancing approximation and the principle of minimum differentiation":
    also connected through other hyperedges:
      (none)
  Member "fault tolerant hotelling games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hotelling games with multiple line faults")
  Member "hotelling games with multiple line faults":
    also connected through other hyperedges:
      (none)
  Member "political discourse on social media echo chambers gatekeepers and the price of bipartisanship":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "facebook ads monitor an independent auditing system for political ads on facebook")
  Member "shapley facility location games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "from hotelling to load balancing approximation and the principle of minimum differentiation")
  Member "hotelling games on networks existence and efficiency of equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hotelling games with multiple line faults")
  Member "hotelling downs model with limited attraction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "manipulating elections by selecting issues")
  Member "mechanism design with uncertain inputs to err is human to forgive divine":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hotelling games with multiple line faults")

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)