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 "truthful fair division without free disposal"):
  Abstract: We study the problem of fairly dividing a heterogeneous resource, commonly known as cake cutting and chore division, in the presence of strategic agents. While a number of results in this setting have been established in previous works, they rely crucially on the free disposal assumption, meaning that the mechanism is allowed to throw away part of the resource at no cost. In the present work, we remove this assumption and focus on mechanisms that always allocate the entire resource. We exhibit a truthful envy-free mechanism for cake cutting and chore division for two agents with piecewise uniform valuations, and we complement our result by showing that such a mechanism does not exist when certain additional assumptions are made. Moreover, we give truthful mechanisms for multiple agents with restricted classes of valuations.

Includes members:
  Member "on the complexity of chore division":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "chore division on a graph")
  Member "deterministic strategyproof and fair cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "obvious manipulations in cake cutting")
  Member "a discrete and bounded envy free cake cutting protocol for any number of agents":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximin fairness with mixed divisible and indivisible goods")
  Member "a discrete and bounded envy free cake cutting protocol for four agents":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "consenus halving does it ever get easier")
  Member "cake cutting algorithms for piecewise constant and piecewise uniform valuations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "monotonicity and competitive equilibrium in cake cutting")
  Member "incentive compatible two player cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fair cake cutting in practice")
  Member "truthful fair division":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "obvious manipulations in cake cutting")

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)