human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "fairness and efficiency in cake cutting with single peaked preferences"):
  with members:
    - "obvious manipulations in cake cutting"
    - "fair division with minimal sharing"
    - "fair cake cutting in practice"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"

Connected through hyperedge HE-2 (induced by source paper "fair division of mixed divisible and indivisible goods"):
  with members:
    - "efx exists for three agents"
    - "an improved approximation algorithm for maximin shares"
    - "truthful fair division without free disposal"
    - "approximation algorithms for computing maximin share allocations"
    - "almost envy freeness with general valuations"
    - "the query complexity of cake cutting"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "a discrete and bounded envy free cake cutting protocol for four agents"

Connected through hyperedge HE-3 (induced by source paper "competitive equilibrium for almost all incomes existence and fairness"):
  with members:
    - "approximating nash social welfare under submodular valuations through un matchings"
    - "competitive equilibrium with generic budgets beyond additive"
    - "negotiation strategies for agents with ordinal preferences"
    - "on the proximity of markets with integral equilibria"
    - "the complexity of cake cutting with unequal shares"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "competitive division of a mixed manna"
    - "competitive equilibria with indivisible goods and generic budgets"

Connected through hyperedge HE-4 (induced by source paper "competitive division of a mixed manna"):
  with members:
    - "convex program duality fisher markets and nash social welfare"
    - "dividing goods or bads under additive utilities"
    - "nash social welfare for indivisible items under separable piecewise linear concave utilities"
    - "nash social welfare matrix permanent and stable polynomials"
    - "apx hardness of maximizing nash social welfare with indivisible items"
    - "rental harmony with roommates"

Connected through hyperedge HE-5 (induced by source paper "envy free division of land"):
  with members:
    - "fair and square cake cutting in two dimensions"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "waste makes haste bounded time algorithms for envy free cake cutting with free disposal"
    - "envy free cake cutting in two dimensions"
    - "redividing the cake"
    - "rental harmony with roommates"

Connected through hyperedge HE-6 (induced by source paper "dividing goods or bads under additive utilities"):
  with members:
    - "competitive division of a mixed manna"
    - "apx hardness of maximizing nash social welfare with indivisible items"

Connected through hyperedge HE-7 (induced by source paper "fair cake cutting among families"):
  with members:
    - "almost envy freeness in group resource allocation"
    - "the complexity of cake cutting with unequal shares"
    - "competitive division of a mixed manna"
    - "approximate maximin shares for groups of agents"
    - "fair and square cake cutting in two dimensions"
    - "resource monotonicity and population monotonicity in connected cake cutting"
    - "democratic fair allocation of indivisible goods"

Question: Please tell me which class the center node 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)