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 "how to re divide a cake fairly"):
  Abstract: This paper studies the classic problem of fairly dividing a heterogeneous resource ("cake") among several agents with different value measures. The innovation is that the resource is already divided among several "old" agents. When "young" agents come, the resource should be re-divided in a way that is fair both for the young and for the old agents. #R##N#Motivated by re-division of land and other real-life division problems, we present re-division protocols for various settings that differ in the geometric constraints on the cake and its pieces: (a) no geometric constraints - the cake is an arbitrary Borel subset of the plane and the pieces may be arbitrary Borel subsets of it; (b) connectivity - the cake is a one-dimensional interval and each piece must be a contiguous interval; (c) rectangularity - the cake is a two-dimensional rectangle or rectilinear polygon and the pieces should be rectangles; (d) convexity - the cake is a two-dimensional convex polygon and the pieces should be convex. #R##N#Our re-division protocols have implications on another problem: the price-of-fairness - the loss of social welfare caused by fairness requirements. Each protocol implies an upper bound on the price-of-fairness with the respective geometric constraints.

Includes members:
  Member "fair and square cake cutting in two dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dividing a graphical cake")
  Member "cutting a cake without harming the toppings":
    also connected through other hyperedges:
      (none)
  Member "envy free cake cutting in two dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "developments in multi agent fair allocation")
  Member "web and internet economics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mechanism design for value maximizers")
  Member "cake cutting algorithms for piecewise constant and piecewise uniform valuations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "monotonicity and competitive equilibrium in cake cutting")
  Member "online cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online fair division a survey")
  Member "graph theoretic solutions to computational geometry problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rectangle transformation problem")

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)