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 "approximate equilibrium and incentivizing social coordination"):
  Abstract: We study techniques to incentivize self-interested agents to form socially desirable solutions in scenarios where they benefit from mutual coordination. Towards this end, we consider coordination games where agents have different intrinsic preferences but they stand to gain if others choose the same strategy as them. For non-trivial versions of our game, stable solutions like Nash Equilibrium may not exist, or may be socially inefficient even when they do exist. This motivates us to focus on designing efficient algorithms to compute (almost) stable solutions like Approximate Equilibrium that can be realized if agents are provided some additional incentives. Our results apply in many settings like adoption of new products, project selection, and group formation, where a central authority can direct agents towards a strategy but agents may defect if they have better alternatives. We show that for any given instance, we can either compute a high quality approximate equilibrium or a near-optimal solution that can be stabilized by providing small payments to some players. We then generalize our model to encompass situations where player relationships may exhibit complementarities and present an algorithm to compute an Approximate Equilibrium whose stability factor is linear in the degree of complementarity. Our results imply that a little influence is necessary in order to ensure that selfish players coordinate and form socially efficient solutions.

Includes members:
  Member "group activity selection problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robustness against agent failure in hedonic games")
  Member "approximate strong equilibrium in job scheduling games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the verification and computation of strong nash equilibrium")
  Member "strong price of anarchy and coalitional dynamics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "assignment games with conflicts price of total anarchy and convergence results via semi smoothness")
  Member "assignment games with conflicts price of total anarchy and convergence results via semi smoothness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on existence and properties of approximate pure nash equilibria in bandwidth allocation games")
  Member "on discrete preferences and coordination":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "local aggregation in preference games")
  Member "combinatorial auctions with restricted complements":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "stable partitions in additively separable hedonic games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on maximizing egalitarian value in k coalitional hedonic games")
  Member "dynamics of profit sharing games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on existence and properties of approximate pure nash equilibria in bandwidth allocation 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)