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: "competitive equilibria with indivisible goods and generic budgets"
  Abstract: Competitive equilibrium from equal incomes (CEEI) is a classic solution to the problem of fair and efficient allocation of goods [Foley'67, Varian'74]. Every agent receives an equal budget of artificial currency with which to purchase goods, and prices match demand and supply. However, a CEEI is not guaranteed to exist when the goods are indivisible, even in the simple two-agent, single-item market. Yet, it is easy to see that once the two budgets are slightly perturbed (made generic), a competitive equilibrium does exist. #R##N#In this paper we aim to extend this approach beyond the single-item case, and study the existence of equilibria in markets with two agents and additive preferences over multiple items. We show that for agents with equal budgets, making the budgets generic -- by adding vanishingly small random perturbations -- ensures the existence of an equilibrium. We further consider agents with arbitrary non-equal budgets, representing non-equal entitlements for goods. We show that competitive equilibrium guarantees a new notion of fairness among non-equal agents, and that it exists in cases of interest (like when the agents have identical preferences) if budgets are perturbed. Our results open opportunities for future research on generic equilibrium existence and fair treatment of non-equals.

Connected through hyperedge HE-1 (induced by source paper "a polynomial time algorithm for computing a pareto optimal and almost proportional allocation"):
  with members:
    - "fair division with minimal sharing"
    - "algorithms for competitive division of chores"
    - "weighted maxmin fair share allocation of indivisible chores"
    - "fair allocation of combinations of indivisible goods and chores"
    - "on the proximity of markets with integral equilibria"
    - "fair allocation of indivisible goods to asymmetric agents"

Connected through hyperedge HE-2 (induced by source paper "fair division with minimal sharing"):
  with members:
    - "competitive division of a mixed manna"
    - "almost envy freeness with general valuations"
    - "online fair division analysing a food bank problem"
    - "a generalization of the al method for fair allocation of indivisible objects"
    - "truthful fair division"

Connected through hyperedge HE-3 (induced by source paper "weighted maxmin fair share allocation of indivisible chores"):
  with members:
    - "fair allocation of combinations of indivisible goods and chores"
    - "the complexity of cake cutting with unequal shares"
    - "fair allocation of indivisible goods to asymmetric agents"
    - "approximation algorithms for computing maximin share allocations"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"

Connected through hyperedge HE-4 (induced by source paper "bipartite envy free matching"):
  with members:
    - "competitive equilibria in two sided matching markets with non transferable utilities"

Connected through hyperedge HE-5 (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"
    - "monotonicity and competitive equilibrium in cake cutting"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "democratic fair allocation of indivisible goods"):
  with members:
    - "fairly allocating contiguous blocks of indivisible items"
    - "almost envy freeness in group resource allocation"
    - "connected fair allocation of indivisible goods"
    - "computing a small agreeable set of indivisible items"
    - "comparing approximate relaxations of envy freeness"
    - "fair allocation of combinations of indivisible goods and chores"
    - "almost envy free allocations with connected bundles"
    - "lecture notes on fair division"

Connected through hyperedge HE-7 (induced by source paper "fair allocation of indivisible goods to asymmetric agents"):
  with members:
    - "approximation algorithms for computing maximin share allocations"
    - "fair allocation of indivisible goods improvement and generalization"

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)