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: "greedy algorithms for maximizing nash social welfare"
  Abstract: We study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. The extent of fairness of an allocation is measured by its Nash social welfare, which is the geometric mean of the valuations of the agents for their bundles. While the problem of maximizing Nash social welfare is known to be APX-hard in general, we study the effectiveness of simple, greedy algorithms in solving this problem in two interesting special cases. #R##N#First, we show that a simple, greedy algorithm provides a 1.061-approximation guarantee when agents have identical valuations, even though the problem of maximizing Nash social welfare remains NP-hard for this setting. Second, we show that when agents have binary valuations over the goods, an exact solution (i.e., a Nash optimal allocation) can be found in polynomial time via a greedy algorithm. Our results in the binary setting extend to provide novel, exact algorithms for optimizing Nash social welfare under concave valuations. Notably, for the above mentioned scenarios, our techniques provide a simple alternative to several of the existing, more sophisticated techniques for this problem such as constructing equilibria of Fisher markets or using real stable polynomials.

Connected through hyperedge HE-1 (induced by source paper "maximum nash welfare and other stories about efx"):
  with members:
    - "envy freeness up to any item with high nash welfare the virtue of donating items"
    - "almost envy freeness in group resource allocation"
    - "approximating nash social welfare under submodular valuations through un matchings"
    - "maximin aware allocations of indivisible goods"
    - "greedy algorithms for fair division of mixed manna"
    - "an improved approximation algorithm for maximin shares"
    - "groupwise maximin fair allocation of indivisible goods"
    - "approximation algorithms for computing maximin share allocations"

Connected through hyperedge HE-2 (induced by source paper "greedy algorithms for fair division of mixed manna"):
  with members:
    - "almost envy freeness and welfare efficiency in fair division with goods or bads"
    - "comparing approximate relaxations of envy freeness"
    - "fair allocation of combinations of indivisible goods and chores"
    - "competitive division of a mixed manna"
    - "almost envy freeness with general valuations"
    - "finding fair and efficient allocations"
    - "dividing goods or bads under additive utilities"
    - "online fair division analysing a food bank problem"

Connected through hyperedge HE-3 (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"
    - "competitive division of a mixed manna"
    - "almost envy freeness with general valuations"
    - "democratic fair allocation of indivisible goods"
    - "fair assignment of indivisible objects under ordinal preferences"

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)