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 "almost group envy free allocation of indivisible goods and chores"):
  Abstract: We consider a multi-agent resource allocation setting in which an agent's utility may decrease or increase when an item is allocated. We take the group envy-freeness concept that is well-established in the literature and present stronger and relaxed versions that are especially suitable for the allocation of indivisible items. Of particular interest is a concept called group envy-freeness up to one item (GEF1). We then present a clear taxonomy of the fairness concepts. We study which fairness concepts guarantee the existence of a fair allocation under which preference domain. For two natural classes of additive utilities, we design polynomial-time algorithms to compute a GEF1 allocation. We also prove that checking whether a given allocation satisfies GEF1 is coNP-complete when there are either only goods, only chores or both.

Includes members:
  Member "almost envy freeness in group resource allocation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "fair allocation of combinations of indivisible goods and chores":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equitable allocations of indivisible chores")
  Member "fair allocation of indivisible public goods":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "participatory budgeting models and approaches")
  Member "greedy algorithms for maximizing nash social welfare":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "competitive division of a mixed manna":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "equitable allocations of indivisible chores")
  Member "almost envy freeness with general valuations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equitable allocations of indivisible chores")
  Member "democratic fair allocation of indivisible goods":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the fairness of time critical influence maximization in social networks")
  Member "fair assignment of indivisible objects under ordinal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "swap dynamics in single peaked house markets")

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)