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: "rental harmony with roommates"
  Abstract: We prove existence of envy-free allocations in markets with heterogenous indivisible goods and money, when a given quantity is supplied from each of the goods and agents have unit demands. We depart from most of the previous literature by allowing agents' preferences over the goods to depend on the entire vector of prices. Our proof uses Shapley's K-K-M-S theorem and Hall's marriage lemma. We then show how our theorem may be applied in two related problems: Existence of envy-free allocations in a version of the cake-cutting problem, and existence of equilibrium in an exchange economy with indivisible goods and money.

Connected through hyperedge HE-1 (induced by source paper "competitive division of a mixed manna"):
  with members:
    - "monotonicity and competitive equilibrium in cake cutting"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "fair and square cake cutting in two dimensions"):
  with members:
    - "envy free cake cutting in two dimensions"
    - "mechanism design for fair division"
    - "truthful fair division"

Connected through hyperedge HE-3 (induced by source paper "envy free division of land"):
  with members:
    - "monotonicity and competitive equilibrium in cake cutting"
    - "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"

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)