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 "maximin fairness with mixed divisible and indivisible goods"):
  Abstract: We study fair resource allocation when the resources contain a mixture of divisible and indivisible goods, focusing on the well-studied fairness notion of maximin share fairness (MMS). With only indivisible goods, a full MMS allocation may not exist, but a constant multiplicative approximate allocation always does. We analyze how the MMS approximation guarantee would be affected when the resources to be allocated also contain divisible goods. In particular, we show that the worst-case MMS approximation guarantee with mixed goods is no worse than that with only indivisible goods. However, there exist problem instances to which adding some divisible resources would strictly decrease the MMS approximation ratio of the instance. On the algorithmic front, we propose a constructive algorithm that will always produce an $\alpha$-MMS allocation for any number of agents, where $\alpha$ takes values between $1/2$ and $1$ and is a monotone increasing function determined by how agents value the divisible goods relative to their MMS values.

Includes members:
  Member "computing envy freeable allocations with limited subsidies":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achieving envy freeness and equitability with monetary transfers")
  Member "one dollar each eliminates envy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "achieving envy freeness and equitability with monetary transfers")
  Member "fair division of mixed divisible and indivisible goods":
    also connected through other hyperedges:
      (none)
  Member "weighted maxmin fair share allocation of indivisible chores":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "equitable allocations of indivisible chores")
  Member "maximin share allocations on cycles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the price of connectivity in fair division")
  Member "an improved approximation algorithm for maximin shares":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "an algorithmic framework for approximating maximin share allocation of chores":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equitable allocations of indivisible chores")
  Member "strategyproof and approximately maxmin fair share allocation of chores":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)