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 "cooperative games with overlapping coalitions charting the tractability frontier"):
  Abstract: In many multiagent scenarios, agents distribute resources, such as time or energy, among several tasks. Having completed their tasks and generated profits, task payoffs must be divided among the agents in some reasonable manner. Cooperative games with overlapping coalitions (OCF games) are a recent framework proposed by Chalkiadakis et al. (2010), generalizing classic cooperative games to the case where agents may belong to more than one coalition. Having formed overlapping coalitions and divided profits, some agents may feel dissatisfied with their share of the profits, and would like to deviate from the given outcome. However, deviation in OCF games is a complicated matter: agents may decide to withdraw only some of their weight from some of the coalitions they belong to; that is, even after deviation, it is possible that agents will still be involved in tasks with non-deviators. This means that the desirability of a deviation, and the stability of formed coalitions, is to a great extent determined by the reaction of non-deviators. In this work, we explore algorithmic aspects of OCF games, focusing on the core in OCF games. We study the problem of deciding if the core of an OCF game is not empty, and whether a core payoff division can be found in polynomial time; moreover, we identify conditions that ensure that the problem admits polynomial time algorithms. Finally, we introduce and study a natural class of OCF games, Linear Bottleneck Games. Interestingly, we show that such games always have a non-empty core, even assuming a highly lenient reaction to deviations.

Includes members:
  Member "on parameterized complexity of group activity selection problems on social networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "balanced stable marriage how close is close enough")
  Member "group activity selection on social networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robustness against agent failure in hedonic games")
  Member "hedonic games with graph restricted communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hedonic seat arrangement problems")
  Member "coalition games on interaction graphs a horticultural perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computing stable coalitions approximation algorithms for reward sharing")
  Member "the authorship dilemma alphabetical or contribution":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "re incentivizing discovery mechanisms for partial progress sharing in research")
  Member "on the complexity of core kernel and bargaining set":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity results for preference aggregation over m cp nets pareto and majority voting")
  Member "cooperative games with overlapping coalitions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dynamic network slicing for scalable fog computing systems with energy harvesting")
  Member "an anytime algorithm for optimal coalition structure generation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stable outcomes in modified fractional hedonic 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)