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 "fair division of mixed divisible and indivisible goods"):
  Abstract: We study the problem of fair division when the resources contain both divisible and indivisible goods. Classic fairness notions such as envy-freeness (EF) and envy-freeness up to one good (EF1) cannot be directly applied to the mixed goods setting. In this work, we propose a new fairness notion envy-freeness for mixed goods (EFM), which is a direct generalization of both EF and EF1 to the mixed goods setting. We prove that an EFM allocation always exists for any number of agents. We also propose efficient algorithms to compute an EFM allocation for two agents and for $n$ agents with piecewise linear valuations over the divisible goods. Finally, we relax the envy-free requirement, instead asking for $\epsilon$-envy-freeness for mixed goods ($\epsilon$-EFM), and present an algorithm that finds an $\epsilon$-EFM allocation in time polynomial in the number of agents, the number of indivisible goods, and $1/\epsilon$.

Includes members:
  Member "efx exists for three agents":
    also connected through other hyperedges:
      (none)
  Member "an improved approximation algorithm for maximin shares":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "monotonicity and competitive equilibrium in cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fairness and efficiency in cake cutting with single peaked preferences")
  Member "truthful fair division without free disposal":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fair cake cutting in practice")
  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 "almost envy freeness with general valuations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "equitable allocations of indivisible chores")
  Member "the query complexity of cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "contiguous cake cutting hardness results and approximation algorithms")
  Member "a discrete and bounded envy free cake cutting protocol for any number of agents":
    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)