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 "fair division through information withholding"):
  Abstract: Envy-freeness up to one good (EF1) is a well-studied fairness notion for indivisible goods that addresses pairwise envy by the removal of at most one good. In the worst case, each pair of agents might require the (hypothetical) removal of a different good, resulting in a weak aggregate guarantee. We study allocations that are nearly envy-free in aggregate, and define a novel fairness notion based on information withholding. Under our notion, an agent can withhold (or hide) some of the goods in its bundle and reveal the remaining goods to the other agents. We observe that in practice, envy-freeness can be achieved by withholding only a small number of goods overall. We show that finding allocations that withhold an optimal number of goods is computationally hard even for highly restricted classes of valuations. On our way, we show that for binary valuations, finding an envy-free allocation is NP-complete---somewhat surprisingly, this fundamental question was unresolved prior to our work. In contrast to the worst-case results, our experiments on synthetic and real-world preference data show that existing algorithms for finding EF1 allocations withhold close-to-optimal amount of information.

Includes members:
  Member "envy freeness up to any item with high nash welfare the virtue of donating items":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "fair division with minimal sharing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equitable allocations of indivisible chores")
  Member "a little charity guarantees almost envy freeness":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fair and truthful mechanisms for dichotomous valuations")
  Member "maximin aware allocations of indivisible goods":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "when do envy free allocations exist":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the price of connectivity in fair division")
  Member "networked fairness in cake cutting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the price of connectivity in fair division")
  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")
  Member "fair assignment of indivisible objects under ordinal preferences":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "swap dynamics in single peaked house markets")

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)