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 without disparate impact"):
  Abstract: We consider the problem of dividing items between individuals in a way that is fair both in the sense of distributional fairness and in the sense of not having disparate impact across protected classes. An important existing mechanism for distributionally fair division is competitive equilibrium from equal incomes (CEEI). Unfortunately, CEEI will not, in general, respect disparate impact constraints. We consider two types of disparate impact measures: requiring that allocations be similar across protected classes and requiring that average utility levels be similar across protected classes. We modify the standard CEEI algorithm in two ways: equitable equilibrium from equal incomes, which removes disparate impact in allocations, and competitive equilibrium from equitable incomes which removes disparate impact in attained utility levels. We show analytically that removing disparate impact in outcomes breaks several of CEEI's desirable properties such as envy, regret, Pareto optimality, and incentive compatibility. By contrast, we can remove disparate impact in attained utility levels without affecting these properties. Finally, we experimentally evaluate the tradeoffs between efficiency, equity, and disparate impact in a recommender-system based market.

Includes members:
  Member "computing large market equilibria using abstractions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "increasing iterate averaging for solving saddle point problems")
  Member "pacing equilibrium in first price auction markets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "stability and learning in strategic queuing systems")
  Member "beyond parity fairness objectives for collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fair active learning")
  Member "algorithmic decision making and the cost of fairness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algorithmic fairness")
  Member "convex program duality fisher markets and nash social welfare":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "maximum nash welfare and other stories about efx")
  Member "on the im possibility of fairness":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algorithmic fairness")
  Member "inherent trade offs in the fair determination of risk scores":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "algorithmic fairness")
  Member "man is to computer programmer as woman is to homemaker debiasing word embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "algorithmic fairness")

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)