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 allocation of combinations of indivisible goods and chores"):
  Abstract: We consider the problem of fairly dividing a set of items. Much of the fair division literature assumes that the items are `goods' i.e., they yield positive utility for the agents. There is also some work where the items are `chores' that yield negative utility for the agents. In this paper, we consider a more general scenario where an agent may have negative or positive utility for each item. This framework captures, e.g., fair task assignment, where agents can have both positive and negative utilities for each task. We show that whereas some of the positive axiomatic and computational results extend to this more general setting, others do not. We present several new and efficient algorithms for finding fair allocations in this general setting. We also point out several gaps in the literature regarding the existence of allocations satisfying certain fairness and efficiency properties and further study the complexity of computing such allocations.

Includes members:
  Member "almost envy free allocations with connected bundles":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fairrec two sided fairness for personalized recommendations in two sided platforms")
  Member "competitive division of a mixed manna":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equitable allocations of indivisible chores")
  Member "approximation algorithms for computing maximin share allocations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "fair division of a graph":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "optimal reallocation under additive and ordinal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "swap dynamics in single peaked house markets")
  Member "dividing goods or bads under additive utilities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "greedy algorithms for fair division of mixed manna")
  Member "fair assignment of indivisible objects under ordinal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)