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 maximin shares for groups of agents"):
  Abstract: Abstract   We investigate the problem of fairly allocating indivisible goods among interested agents using the concept of maximin share. Procaccia and Wang showed that while an allocation that gives every agent at least her maximin share does not necessarily exist, one that gives every agent at least    2  ∕  3    of her share always does. In this paper, we consider the more general setting where we allocate the goods to  groups  of agents. The agents in each group share the same set of goods even though they may have conflicting preferences. For two groups, we characterize the cardinality of the groups for which a positive approximation of the maximin share is possible regardless of the number of goods. We also show settings where an approximation is possible or impossible when there are several groups.

Includes members:
  Member "fairly allocating contiguous blocks of indivisible items":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equitable allocations of indivisible chores")
  Member "fair allocation of indivisible goods to asymmetric agents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "truthful allocation mechanisms without payments characterization and implications on fairness":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fair and truthful mechanisms for dichotomous valuations")
  Member "approximation algorithms for computing maximin share allocations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "fair division of a graph":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "assigning a small agreeable set of indivisible items to multiple players":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computing a small agreeable set of indivisible items")
  Member "on truthful mechanisms for maximin share allocations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fair and truthful mechanisms for dichotomous valuations")
  Member "asymptotic existence of proportionally fair allocations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fairly allocating contiguous blocks of indivisible items")

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)