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 "distance based equilibria in normal form games"):
  Abstract: We propose a simple uncertainty modification for the agent model in normal-form games; at any given strategy profile, the agent can access only a set of "possible profiles" that are within a certain distance from the actual action profile. We investigate the various instantiations in which the agent chooses her strategy using well-known rationales e.g., considering the worst case, or trying to minimize the regret, to cope with such uncertainty. Any such modification in the behavioral model naturally induces a corresponding notion of equilibrium; a distance-based equilibrium. We characterize the relationships between the various equilibria, and also their connections to well-known existing solution concepts such as Trembling-hand perfection. Furthermore, we deliver existence results, and show that for some class of games, such solution concepts can actually lead to better outcomes.

Includes members:
  Member "heuristic voting as ordinal dominance strategies":
    also connected through other hyperedges:
      (none)
  Member "lipschitz continuity and approximate equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating the existential theory of the reals")
  Member "a local dominance theory of voting equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lie on the fly strategic voting in an iterative preference elicitation process")
  Member "congestion games with distance based strict uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "uncertainty in multi commodity routing networks when does it help")
  Member "regret minimizing equilibria and mechanisms for games with strict type uncertainty":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust and approximately stable marriages under partial information")
  Member "dominating manipulations in voting with partial information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lie on the fly strategic voting in an iterative preference elicitation process")
  Member "the many faces of rationalizability":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the role of monotonicity in the epistemic analysis of strategic 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)