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 "computing a small agreeable set of indivisible items"):
  Abstract: Abstract   We study the problem of assigning a small subset of indivisible items to a group of agents so that the subset is agreeable to all agents, meaning that all agents value the subset as least as much as its complement. For an arbitrary number of agents and items, we derive a tight worst-case bound on the number of items that may need to be included in such a set. We then present polynomial-time algorithms that find an agreeable set whose size matches the worst-case bound when there are two or three agents. We also show that finding small agreeable sets is possible even when we only have access to the agents' preferences on single items. Furthermore, we investigate the problem of efficiently computing an agreeable set whose size approximates the size of the smallest agreeable set for any given instance. We consider two well-known models for representing the preferences of the agents—the value oracle model and additive utilities—and establish tight bounds on the approximation ratio that can be obtained by algorithms running in polynomial time in each of these models.

Includes members:
  Member "fair division under cardinality constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fairrec two sided fairness for personalized recommendations in two sided platforms")
  Member "approximation algorithms for computing maximin share allocations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "approximate maximin shares for groups of agents":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "democratic fair allocation of indivisible goods":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the fairness of time critical influence maximization in social networks")
  Member "assigning a small agreeable set of indivisible items to multiple players":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "almost envy freeness in group resource allocation")
  Member "envy free cake cutting among families":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "almost envy freeness in group resource allocation")
  Member "proportional cake cutting among families":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximate maximin shares for groups of agents")
  Member "finding a collective set of items from proportional multirepresentation to group recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "evaluating approval based multiwinner voting in terms of robustness to noise")

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)