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 "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.

Includes members:
  Member "fair allocation of indivisible goods to asymmetric agents":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "truthful allocation mechanisms without payments characterization and implications on fairness":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fair and truthful mechanisms for dichotomous valuations")
  Member "almost envy freeness with general valuations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "equitable allocations of indivisible chores")
  Member "approximating the nash social welfare with budget additive valuations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efx exists for three agents")
  Member "communication complexity of discrete fair division":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the price of connectivity in fair division")
  Member "competitive equilibrium for almost all incomes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equitable allocations of indivisible chores")
  Member "convex program duality fisher markets and nash social welfare":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "nash social welfare for indivisible items under separable piecewise linear concave utilities":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efx exists for three agents")

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)