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 "monotonicity and competitive equilibrium in cake cutting"):
  Abstract: We study monotonicity properties of solutions to the classic problem of fair cake-cutting—dividing a heterogeneous resource among agents with different preferences. Resource- and population-monotonicity relate to scenarios where the cake, or the number of participants who divide the cake, changes. It is required that the utility of all participants change in the same direction: either all of them are better-off (if there is more to share or fewer to share among) or all are worse-off (if there is less to share or more to share among). We formally introduce these concepts to the cake-cutting setting and show that they are violated by common division rules. In contrast, we prove that the Nash-optimal rule—maximizing the product of utilities—is resource-monotonic and population-monotonic, in addition to being Pareto-optimal, envy-free and satisfying a strong competitive-equilibrium condition. Moreover, we prove that it is the only rule among a natural family of welfare-maximizing rules that is both proportional and resource-monotonic.

Includes members:
  Member "competitive division of a mixed manna":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equitable allocations of indivisible chores")
  Member "resource monotonicity and population monotonicity in connected cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "obvious manipulations in cake cutting")
  Member "nash social welfare approximation for strategic agents":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fair by design matching")
  Member "continuity assumptions in cake cutting":
    also connected through other hyperedges:
      (none)
  Member "redividing the cake":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the constrained round robin algorithm for fair and efficient allocation")
  Member "an algorithmic framework for strategic fair division":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fair cake cutting in practice")
  Member "cake cutting algorithms for piecewise constant and piecewise uniform valuations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "obvious manipulations in cake cutting")
  Member "online cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "online fair division a survey")

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)