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 "algorithms for competitive division of chores"):
  Abstract: We study the problem of allocating divisible bads (chores) among multiple agents with additive utilities, when money transfers are not allowed. The competitive rule is known to be the best mechanism for goods with additive utilities and was recently extended to chores by Bogomolnaia et al (2017). For both goods and chores, the rule produces Pareto optimal and envy-free allocations. In the case of goods, the outcome of the competitive rule can be easily computed. Competitive allocations solve the Eisenberg-Gale convex program; hence the outcome is unique and can be approximately found by standard gradient methods. An exact algorithm that runs in polynomial time in the number of agents and goods was given by Orlin. In the case of chores, the competitive rule does not solve any convex optimization problem; instead, competitive allocations correspond to local minima, local maxima, and saddle points of the Nash Social Welfare on the Pareto frontier of the set of feasible utilities. The rule becomes multivalued and none of the standard methods can be applied to compute its outcome. In this paper, we show that all the outcomes of the competitive rule for chores can be computed in strongly polynomial time if either the number of agents or the number of chores is fixed. The approach is based on a combination of three ideas: all consumption graphs of Pareto optimal allocations can be listed in polynomial time; for a given consumption graph, a candidate for a competitive allocation can be constructed via explicit formula; and a given allocation can be checked for being competitive using a maximum flow computation as in Devanur et al (2002). Our algorithm immediately gives an approximately-fair allocation of indivisible chores by the rounding technique of Barman and Krishnamurthy (2018).

Includes members:
  Member "fair division with minimal sharing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "universal growth in production economies":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proportional dynamics in exchange economies")
  Member "fair allocation of combinations of indivisible goods and chores":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equitable allocations of indivisible chores")
  Member "on the proximity of markets with integral equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a polynomial time algorithm for computing a pareto optimal and almost proportional allocation")
  Member "competitive division of a mixed manna":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equitable allocations of indivisible chores")
  Member "approximation algorithms for computing maximin share allocations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (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)