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 algorithmic framework for approximating maximin share allocation of chores"):
  Abstract: In this paper, we consider the problem of how to fairly dividing $m$ indivisible chores among $n$ agents. The fairness measure we considered here is the maximin share. The previous best known result is that there always exists a $\frac{4}{3}$ approximation maximin share allocation. With a novel algorithm, we can always find a $\frac{11}{9}$ approximation maximin share allocation for any instances. We also discuss how to improve the efficiency of the algorithm and its connection to the job scheduling problem.

Includes members:
  Member "envy freeness up to any item with high nash welfare the virtue of donating items":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximum nash welfare and other stories about efx")
  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 "weighted maxmin fair share allocation of indivisible chores":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "an improved approximation algorithm for maximin shares":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "strategyproof and approximately maxmin fair 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 "fair allocation of combinations of indivisible goods and chores":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equitable allocations of indivisible chores")
  Member "approximation algorithms for computing maximin share allocations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "almost envy freeness with general valuations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "equitable allocations of indivisible chores")

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)