human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "metastability of potential games"
  Abstract: One of the main criticisms to game theory concerns the assumption of full rationality. Logit dynamics is a decentralized algorithm in which a level of irrationality (a.k.a. "noise") is introduced in players' behavior. In this context, the solution concept of interest becomes the logit equilibrium, as opposed to Nash equilibria. Logit equilibria are distributions over strategy profiles that possess several nice properties, including existence and uniqueness. However, there are games in which their computation may take exponential time. We therefore look at an approximate version of logit equilibria, called metastable distributions, introduced by Auletta et al. [SODA 2012]. These are distributions which remain stable (i.e., players do not go too far from it) for a super-polynomial number of steps (rather than forever, as for logit equilibria). The hope is that these distributions exist and can be reached quickly by logit dynamics. #R##N#We devise a sufficient condition for potential games to admit distributions which are metastable no matter the level of noise present in the system, and the starting profile of the dynamics. These distributions can be quickly reached if the rationality level is not too big when compared to the inverse of the maximum difference in potential. Our proofs build on results which may be of independent interest. Namely, we prove some spectral characterizations of the transition matrix defined by logit dynamics for generic games and relate several convergence measures for Markov chains.

Connected through hyperedge HE-1 (induced by source paper "price competition fluctuations and welfare guarantees"):
  with members:
    - "price competition in online combinatorial markets"
    - "convergence to equilibrium of logit dynamics for strategic games"
    - "logit dynamics with concurrent updates for local interaction games"
    - "composable and efficient mechanisms"
    - "metastability of logit dynamics for coordination games"
    - "mixing time and stationary expected social welfare of logit dynamics"

Connected through hyperedge HE-2 (induced by source paper "metastability of asymptotically well behaved potential games"):
  with members:
    - "decentralized dynamics for finite opinion games"
    - "convergence to equilibrium of logit dynamics for strategic games"
    - "metastability of logit dynamics for coordination games"
    - "mixing time and stationary expected social welfare of logit dynamics"

Question: Please tell me which class the center node 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)