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: "dynamics of profit sharing games"
  Abstract: An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study the dynamics of coalition formation under bounded rationality. We consider settings where each team's profit is given by a convex function, and propose three profit-sharing schemes, each of which is based on the concept of marginal utility. The agents are assumed to be myopic, i.e., they keep changing teams as long as they can increase their payoff by doing so. We study the properties (such as closeness to Nash equilibrium or total profit) of the states that result after a polynomial number of such moves, and prove bounds on the price of anarchy and the price of stability of the corresponding games.

Connected through hyperedge HE-1 (induced by source paper "on existence and properties of approximate pure nash equilibria in bandwidth allocation games"):
  with members:
    - "budget restricted utility games with ordered strategic decisions"
    - "assignment games with conflicts price of total anarchy and convergence results via semi smoothness"
    - "efficient computation of approximate pure nash equilibria in congestion games"
    - "approximate pure nash equilibria in weighted congestion games existence efficient computation and structure"
    - "congestion games with variable demands"
    - "on the performance of approximate equilibria in congestion games"

Connected through hyperedge HE-2 (induced by source paper "approximate equilibrium and incentivizing social coordination"):
  with members:
    - "group activity selection problem"
    - "approximate strong equilibrium in job scheduling games"
    - "strong price of anarchy and coalitional dynamics"
    - "assignment games with conflicts price of total anarchy and convergence results via semi smoothness"
    - "on discrete preferences and coordination"
    - "combinatorial auctions with restricted complements"
    - "stable partitions in additively separable hedonic games"
    - "strong nash equilibria in games with the lexicographical improvement property"

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)