human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "graphical one sided markets"):
  Abstract: We study the problem of allocating indivisible objects to a set of rational agents where each agent's final utility depends on the intrinsic valuation of the allocated item as well as the allocation within the agent's local neighbourhood. We specify agents' local neighbourhood in terms of a weighted graph. This extends the model of one-sided markets to incorporate neighbourhood externalities. We consider the solution concept of stability and show that, unlike in the case of one-sided markets, stable allocations may not always exist. When the underlying local neighbourhood graph is symmetric, a 2-stable allocation is guaranteed to exist and any decentralised mechanism where pairs of rational players agree to exchange objects terminates in such an allocation. We show that computing a 2-stable allocation is PLS-complete and further identify subclasses which are tractable. In the case of asymmetric neighbourhood structures, we show that it is NP-complete to check if a 2-stable allocation exists. We then identify structural restrictions where stable allocations always exist and can be computed efficiently. Finally, we study the notion of envy-freeness in this framework.

Includes members:
  Member "schelling games on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed pattern formation in a ring")
  Member "swap stability in schelling games on graphs":
    also connected through other hyperedges:
      (none)
  Member "maximin share allocations on cycles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "schelling segregation with strategic agents":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed pattern formation in a ring")
  Member "fair allocation of indivisible items with externalities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reasoning about social choice and games in monadic fixed point logic")
  Member "almost envy free allocations with connected bundles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fairrec two sided fairness for personalized recommendations in two sided platforms")
  Member "fair division of a graph":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "fair division via social comparison":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the price of connectivity in fair division")

Question: Please tell me which class the source paper 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)