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: "online fair division analysing a food bank problem"
  Abstract: We study an online model of fair division designed to capture features of a real world charity problem. We consider two simple mechanisms for this model in which agents simply declare what items they like. We analyse several axiomatic properties of these mechanisms like strategy-proofness and envy-freeness. Finally, we perform a competitive analysis and compute the price of anarchy.

Connected through hyperedge HE-1 (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"
    - "greedy algorithms for maximizing nash social welfare"
    - "competitive division of a mixed manna"
    - "almost envy freeness with general valuations"
    - "finding fair and efficient allocations"
    - "dividing goods or bads under additive utilities"

Connected through hyperedge HE-2 (induced by source paper "fairness efficiency tradeoffs in dynamic fair division"):
  with members:
    - "a simple online fair division problem"
    - "a strongly polynomial algorithm for linear exchange markets"
    - "dynamic fair division problem with general valuations"
    - "when do envy free allocations exist"
    - "approximating the nash social welfare with budget additive valuations"
    - "finding fair and efficient allocations"

Connected through hyperedge HE-3 (induced by source paper "fair division with minimal sharing"):
  with members:
    - "competitive division of a mixed manna"
    - "competitive equilibria with indivisible goods and generic budgets"
    - "almost envy freeness with general valuations"
    - "a generalization of the al method for fair allocation of indivisible objects"
    - "truthful fair division"

Connected through hyperedge HE-4 (induced by source paper "a simple online fair division problem"):
  with members:
    - "dynamic fair division problem with general valuations"
    - "competitive division of a mixed manna"
    - "online cake cutting"
    - "online stochastic matching beating 1 1 e"

Connected through hyperedge HE-5 (induced by source paper "deceased organ matching in australia"):
  with members:
    - "manipulating the probabilistic serial rule"
    - "welfare of sequential allocation mechanisms for indivisible goods"
    - "allocation in practice"
    - "possible and necessary allocations via sequential mechanisms"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "a social welfare optimal sequential allocation procedure"
    - "an empirical study of the manipulability of single transferable voting"
    - "where are the hard manipulation problems"

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)