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: "fair assignment of indivisible objects under ordinal preferences"
  Abstract: We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stochastic dominance relation between fractional or randomized allocations to systematically define varying notions of proportionality and envy-freeness for discrete assignments. The computational complexity of checking whether a fair assignment exists is studied for these fairness notions. We also characterize the conditions under which a fair assignment is guaranteed to exist. For a number of fairness concepts, polynomial-time algorithms are presented to check whether a fair assignment exists. Our algorithmic results also extend to the case of unequal entitlements of agents. Our NP-hardness result, which holds for several variants of envy-freeness, answers an open question posed by Bouveret, Endriss, and Lang (ECAI 2010). We also propose fairness concepts that always suggest a non-empty set of assignments with meaningful fairness properties. Among these concepts, optimal proportionality and optimal weak proportionality appear to be desirable fairness concepts.

Connected through hyperedge HE-1 (induced by source paper "swap dynamics in single peaked house markets"):
  with members:
    - "minimal envy and popular matchings"
    - "optimal reallocation under additive and ordinal preferences"
    - "eliciting single peaked preferences using comparison queries"
    - "extremal behaviour in multiagent contract negotiation"

Connected through hyperedge HE-2 (induced by source paper "developments in multi agent fair allocation"):
  with members:
    - "from matching with diversity constraints to matching with regional quotas"
    - "fair division with minimal sharing"
    - "fairly allocating many goods with few queries"
    - "fair knapsack"
    - "competitive division of a mixed manna"
    - "approximation algorithms for computing maximin share allocations"
    - "proportionally representative participatory budgeting axioms and algorithms"
    - "fair mixing the case of dichotomous preferences"

Connected through hyperedge HE-3 (induced by source paper "computing a small agreeable set of indivisible items"):
  with members:
    - "fair division under cardinality constraints"
    - "approximation algorithms for computing maximin share allocations"
    - "approximate maximin shares for groups of agents"
    - "democratic fair allocation of indivisible goods"
    - "assigning a small agreeable set of indivisible items to multiple players"
    - "envy free cake cutting among families"
    - "proportional cake cutting among families"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"

Connected through hyperedge HE-4 (induced by source paper "fair division through information withholding"):
  with members:
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "fair division with minimal sharing"
    - "a little charity guarantees almost envy freeness"
    - "maximin aware allocations of indivisible goods"
    - "when do envy free allocations exist"
    - "networked fairness in cake cutting"
    - "fair division via social comparison"
    - "analytical approach to parallel repetition"

Connected through hyperedge HE-5 (induced by source paper "online fair division a survey"):
  with members:
    - "facility location problem with capacity constraints algorithmic and mechanism design perspectives"
    - "manipulating the probabilistic serial rule"
    - "welfare of sequential allocation mechanisms for indivisible goods"
    - "the peerrank method for peer assessment"
    - "allocation in practice"
    - "possible and necessary allocations via sequential mechanisms"
    - "a social welfare optimal sequential allocation procedure"
    - "online cake cutting"

Connected through hyperedge HE-6 (induced by source paper "online geometric discrepancy for stochastic arrivals with applications to envy minimization"):
  with members:
    - "on line balancing of random inputs"
    - "on the discrepancy of random low degree set systems"
    - "the gram schmidt walk a cure for the banaszczyk blues"
    - "algorithmic discrepancy beyond partial coloring"
    - "deterministic discrepancy minimization via the multiplicative weight update method"
    - "efficient algorithms for discrepancy minimization in convex sets"
    - "constructive discrepancy minimization by walking on the edges"
    - "constructive algorithms for discrepancy minimization"

Connected through hyperedge HE-7 (induced by source paper "almost group envy free allocation of indivisible goods and chores"):
  with members:
    - "almost envy freeness in group resource allocation"
    - "fair allocation of combinations of indivisible goods and chores"
    - "fair allocation of indivisible public goods"
    - "greedy algorithms for maximizing nash social welfare"
    - "competitive division of a mixed manna"
    - "almost envy freeness with general valuations"
    - "democratic fair allocation of indivisible goods"

Connected through hyperedge HE-8 (induced by source paper "the constrained round robin algorithm for fair and efficient allocation"):
  with members:
    - "fair division of indivisible goods among strategic agents"
    - "fair division under cardinality constraints"
    - "the conference paper assignment problem using order weighted averages to assign indivisible goods"
    - "fair allocation based on diminishing differences"
    - "redividing the cake"
    - "possible and necessary allocations via sequential mechanisms"

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)