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 equilibrium with equal incomes for allocation of indivisible objects"
  Abstract: In AAMAS 2014, Bouveret and Lemaitre (2014) presented a hierarchy of fairness concepts for allocation of indivisible objects. Among them CEEI (Competitive Equilibrium with Equal Incomes) was the strongest. In this note, we settle the complexity of computing a discrete CEEI assignment by showing it is strongly NP-hard. We then highlight a fairness notion (CEEI-FRAC) that is even stronger than CEEI for discrete assignments, is always Pareto optimal, and can be verified in polynomial time. We also show that computing a CEEI-FRAC discrete assignment is strongly NP-hard in general but polynomial-time computable if the utilities are zero or one.

Connected through hyperedge HE-1 (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-2 (induced by source paper "competitive equilibrium for almost all incomes"):
  with members:
    - "competitive division of a mixed manna"
    - "to give or not to give fair division for single minded valuations"
    - "characterization and computation of equilibria for indivisible goods"
    - "the complexity of fairness through equilibrium"
    - "a social welfare optimal sequential allocation procedure"

Connected through hyperedge HE-3 (induced by source paper "characterization and computation of equilibria for indivisible goods"):
  with members:
    - "the complexity of fairness through equilibrium"

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)