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 "an improved approximation algorithm for maximin shares"):
  Abstract: We study the problem of fair allocation of m indivisible items among n agents with additive valuations using the popular notion of maximin share as our measure of fairness. The maximin share (MMS) of an agent is the maximum she can guarantee herself if she is allowed to choose a partition of items into n bundles (one for each agent), with the condition that all other agents get to choose a bundle before her. An MMS allocation provides each agent a bundle worth at least her maximin share. While it is known that such an allocation need not exist, a series of remarkable work provided 2/3 approximation algorithms in which each agent receives a bundle worth at least 2/3 times her maximin share. Recently, in a groundbreaking work, Ghodsi et al. showed the existence of 3/4 MMS allocation and a PTAS to find a 3/4-\epsilon MMS allocation. Most of the previous work utilize intricate algorithms and require agents' approximate MMS values, which are computationally expensive to obtain. #R##N#We present a simple algorithm that obtains a 3/4 MMS allocation and runs in \tilde{O}(n^5m) time. The idea is to start with a trivial upper bound on the MMS values based on the average and greedily assign high-value items to agents. Then, try to satisfy the remaining agents with remaining items using tentative assignment and bag-filling procedures. If the MMS upper bounds are tight enough, then these procedures are guaranteed to succeed. Otherwise, we update it for a certain agent and run the procedures again. We show that the bounds need to be updated at most O(n^3) times.

Includes members:
  Member "fair division of indivisible goods among strategic agents":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fair and truthful mechanisms for dichotomous valuations")
  Member "a little charity guarantees almost envy freeness":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fair and truthful mechanisms for dichotomous valuations")
  Member "maximin share allocations on cycles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "connected fair allocation of indivisible goods":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dividing a graphical cake")
  Member "an algorithmic framework for approximating maximin share allocation of chores":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "the fair division of hereditary set systems":
    also connected through other hyperedges:
      (none)
  Member "fair allocation of indivisible goods to asymmetric agents":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "groupwise maximin fair allocation of indivisible goods":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")

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)