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 allocation without trade"
  Abstract: We consider the age-old problem of allocating items among different agents in a way that is efficient and fair. Two papers, by Dolev et al. and Ghodsi et al., have recently studied this problem in the context of computer systems. Both papers had similar models for agent preferences, but advocated different notions of fairness. We formalize both fairness notions in economic terms, extending them to apply to a larger family of utilities. Noting that in settings with such utilities efficiency is easily achieved in multiple ways, we study notions of fairness as criteria for choosing between different efficient allocations. Our technical results are algorithms for finding fair allocations corresponding to two fairness notions: Regarding the notion suggested by Ghodsi et al., we present a polynomial-time algorithm that computes an allocation for a general class of fairness notions, in which their notion is included. For the other, suggested by Dolev et al., we show that a competitive market equilibrium achieves the desired notion of fairness, thereby obtaining a polynomial-time algorithm that computes such a fair allocation and solving the main open problem raised by Dolev et al.

Connected through hyperedge HE-1 (induced by source paper "efficient multi resource multi unit vcg auction"):
  with members:
    - "non monetary fair scheduling a cooperative game theory approach"
    - "optimal multi dimensional mechanism design reducing revenue to welfare maximization"
    - "no justified complaints on fair sharing of multiple resources"
    - "computationally feasible vcg mechanisms"
    - "optimal solutions for multi unit combinatorial auctions branch and bound heuristics"

Connected through hyperedge HE-2 (induced by source paper "on the cluster admission problem for cloud computing"):
  with members:
    - "overcommitment in cloud services bin packing with chance constraints"
    - "era a framework for economic resource allocation for the cloud"
    - "truthful online scheduling with commitments"
    - "fixed and market pricing for cloud services"
    - "no justified complaints on fair sharing of multiple resources"
    - "finding approximate pomdp solutions through belief compression"
    - "nonapproximability results for partially observable markov decision processes"

Connected through hyperedge HE-3 (induced by source paper "a market based framework for multi resource allocation in fog computing"):
  with members:
    - "price based resource allocation for edge computing a market equilibrium approach"
    - "a survey on mobile edge computing the communication perspective"
    - "nash social welfare approximation for strategic agents"
    - "the complexity of non monotone markets"
    - "nash equilibria in fisher market"

Connected through hyperedge HE-4 (induced by source paper "nash social welfare approximation for strategic agents"):
  with members:
    - "convex program duality fisher markets and nash social welfare"
    - "a discrete and bounded envy free cake cutting protocol for four agents"
    - "an algorithmic framework for strategic fair division"
    - "incentive compatible two player cake cutting"
    - "truthful fair division"
    - "nash equilibria in fisher market"
    - "on allocating goods to maximize fairness"

Connected through hyperedge HE-5 (induced by source paper "egalitarianism of random assignment mechanisms"):
  with members:
    - "random serial dictatorship versus probabilistic serial rule a tale of two random mechanisms"
    - "random assignment with multi unit demands"
    - "social welfare in one sided matchings random priority and beyond"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "cake cutting algorithms for piecewise constant and piecewise uniform valuations"
    - "the computational complexity of random serial dictatorship"
    - "social welfare in one sided matching markets without money"

Connected through hyperedge HE-6 (induced by source paper "a note on the dynamic dominant resource fairness mechanism"):
  with members:
    - "multi resource fair allocation with bounded number of tasks in cloud computing systems"

Connected through hyperedge HE-7 (induced by source paper "multi resource fair allocation with bounded number of tasks in cloud computing systems"):
  with members:
    - "enhanced cluster computing performance through proportional fairness"
    - "multi resource fairness objectives algorithms and performance"
    - "dominant resource fairness in cloud computing systems with heterogeneous servers"
    - "no justified complaints on fair sharing of multiple resources"

Connected through hyperedge HE-8 (induced by source paper "enhanced cluster computing performance through proportional fairness"):
  with members:
    - "dominant resource fairness in cloud computing systems with heterogeneous servers"
    - "no justified complaints on fair sharing of multiple resources"

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)