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 "competitive division of a mixed manna"):
  Abstract: A mixed manna contains goods (that everyone likes), bads (that everyone dislikes), as well as items that are goods to some agents, but bads or satiated to others. #R##N#If all items are goods and utility functions are homothetic, concave (and monotone), the Competitive Equilibrium with Equal Incomes maximizes the Nash product of utilities: hence it is welfarist (determined utility-wise by the feasible set of profiles), single-valued and easy to compute. #R##N#We generalize the Gale-Eisenberg Theorem to a mixed manna. The Competitive division is still welfarist and related to the product of utilities or disutilities. If the zero utility profile (before any manna) is Pareto dominated, the competitive profile is unique and still maximizes the product of utilities. If the zero profile is unfeasible, the competitive profiles are the critical points of the product of disutilities on the efficiency frontier, and multiplicity is pervasive. In particular the task of dividing a mixed manna is either good news for everyone, or bad news for everyone. #R##N#We refine our results in the practically important case of linear preferences, where the axiomatic comparison between the division of goods and that of bads is especially sharp. When we divide goods and the manna improves, everyone weakly benefits under the competitive rule; but no reasonable rule to divide bads can be similarly Resource Monotonic. Also, the much larger set of Non Envious and Efficient divisions of bads can be disconnected so that it will admit no continuous selection.

Includes members:
  Member "monotonicity and competitive equilibrium in cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fairness and efficiency in cake cutting with single peaked preferences")
  Member "convex program duality fisher markets and nash social welfare":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "dividing goods or bads under additive utilities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "greedy algorithms for fair division of mixed manna")
  Member "nash social welfare for indivisible items under separable piecewise linear concave utilities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efx exists for three agents")
  Member "nash social welfare matrix permanent and stable polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efx exists for three agents")
  Member "apx hardness of maximizing nash social welfare with indivisible items":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "rental harmony with roommates":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fair and square cake cutting in two dimensions")

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)