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 envy freeness in group resource allocation"):
  Abstract: We study the problem of fairly allocating indivisible goods between groups of agents using the recently introduced relaxations of envy-freeness. We consider the existence of fair allocations under different assumptions on the valuations of the agents. In particular, our results cover cases of arbitrary monotonic, responsive, and additive valuations, while for the case of binary valuations we fully characterize the cardinalities of two groups of agents for which a fair allocation can be guaranteed with respect to both envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX). Moreover, we introduce a new model where the agents are not partitioned into groups in advance, but instead the partition can be chosen in conjunction with the allocation of the goods. In this model, we show that for agents with arbitrary monotonic valuations, there is always a partition of the agents into two groups of any given sizes along with an EF1 allocation of the goods. We also provide an extension of this result to any number of groups.

Includes members:
  Member "fairly allocating contiguous blocks of indivisible items":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equitable allocations of indivisible chores")
  Member "fairly allocating many goods with few queries":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the price of connectivity in fair division")
  Member "almost envy free allocations with connected bundles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fairrec two sided fairness for personalized recommendations in two sided platforms")
  Member "fair division under cardinality constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fairrec two sided fairness for personalized recommendations in two sided platforms")
  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 "approximate maximin shares for groups of agents":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  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 "assigning a small agreeable set of indivisible items to multiple players":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "computing a small agreeable set of indivisible items")

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)