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: "lipschitz continuity and approximate equilibria"
  Abstract: In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff function allows us to provide algorithms for finding approximate equilibria in these games. We begin by studying Lipschitz games, which encompass, for example, all concave games with Lipschitz continuous payoff functions. We provide an efficient algorithm for computing approximate equilibria in these games. Then we turn our attention to penalty games, which encompass biased games and games in which players take risk into account. Here we show that if the penalty function is Lipschitz continuous, then we can provide a quasi-polynomial time approximation scheme. Finally, we study distance biased games, where we present simple strongly polynomial time algorithms for finding best responses in $L_1$, $L_2^2$, and $L_\infty$ biased games, and then use these algorithms to provide strongly polynomial algorithms that find $2/3$, $5/7$, and $2/3$ approximations for these norms, respectively.

Connected through hyperedge HE-1 (induced by source paper "distance based equilibria in normal form games"):
  with members:
    - "heuristic voting as ordinal dominance strategies"
    - "a local dominance theory of voting equilibria"
    - "congestion games with distance based strict uncertainty"
    - "regret minimizing equilibria and mechanisms for games with strict type uncertainty"
    - "dominating manipulations in voting with partial information"
    - "the many faces of rationalizability"

Connected through hyperedge HE-2 (induced by source paper "approximating the existential theory of the reals"):
  with members:
    - "computing constrained approximate equilibria in polymatrix games"
    - "approximating nash equilibria in tree polymatrix games"
    - "empirical distribution of equilibrium play and its testing application"
    - "inapproximability of np complete variants of nash equilibrium"
    - "most tensor problems are np hard"

Connected through hyperedge HE-3 (induced by source paper "equilibrium computation in resource allocation games"):
  with members:
    - "sensitivity analysis for convex separable optimization over integral polymatroids"
    - "totally unimodular congestion games"
    - "network cournot competition"
    - "resource competition on integral polymatroids"
    - "efficient computation of approximate pure nash equilibria in congestion games"
    - "approximate pure nash equilibria in weighted congestion games existence efficient computation and structure"
    - "settling the complexity of computing two player nash equilibria"

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)