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: "an algorithmic framework for strategic fair division"
  Abstract: We study the paradigmatic fair division problem of allocating a divisible good among agents with heterogeneous preferences, commonly known as cake cutting. Classical cake cutting protocols are susceptible to manipulation. Do their strategic outcomes still guarantee fairness? #R##N#To address this question we adopt a novel algorithmic approach, by designing a concrete computational framework for fair division---the class of Generalized Cut and Choose (GCC) protocols}---and reasoning about the game-theoretic properties of algorithms that operate in this model. The class of GCC protocols includes the most important discrete cake cutting protocols, and turns out to be compatible with the study of fair division among strategic agents. In particular, GCC protocols are guaranteed to have approximate subgame perfect Nash equilibria, or even exact equilibria if the protocol's tie-breaking rule is flexible. We further observe that the (approximate) equilibria of proportional GCC protocols---which guarantee each of the $n$ agents a $1/n$-fraction of the cake---must be (approximately) proportional. Finally, we design a protocol in this framework with the property that its Nash equilibrium allocations coincide with the set of (contiguous) envy-free allocations.

Connected through hyperedge HE-1 (induced by source paper "monotonicity and competitive equilibrium in cake cutting"):
  with members:
    - "competitive division of a mixed manna"
    - "resource monotonicity and population monotonicity in connected cake cutting"
    - "nash social welfare approximation for strategic agents"
    - "continuity assumptions in cake cutting"
    - "redividing the cake"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "online cake cutting"

Connected through hyperedge HE-2 (induced by source paper "fair cake cutting in practice"):
  with members:
    - "truthful fair division without free disposal"
    - "deterministic strategyproof and fair cake cutting"
    - "incentive compatible two player cake cutting"
    - "information theoretic cutting of a cake"
    - "online cake cutting"

Connected through hyperedge HE-3 (induced by source paper "nash social welfare approximation for strategic agents"):
  with members:
    - "convex program duality fisher markets and nash social welfare"
    - "a discrete and bounded envy free cake cutting protocol for four agents"
    - "incentive compatible two player cake cutting"
    - "fair allocation without trade"
    - "truthful fair division"
    - "nash equilibria in fisher market"
    - "on allocating goods to maximize fairness"

Connected through hyperedge HE-4 (induced by source paper "waste makes haste bounded time algorithms for envy free cake cutting with free disposal"):
  with members:
    - "building fences straight and high an optimal algorithm for finding the maximum length you can cut k times from given sticks"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "envy free cake cutting in two dimensions"
    - "a discrete and bounded envy free cake cutting protocol for four agents"
    - "a generalization of the al method for fair allocation of indivisible objects"
    - "throw one s cake and have it too"

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)