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 algorithms for learning in allocation problems"):
  Abstract: Settings such as lending and policing can be modeled by a centralized agent allocating a resource (loans or police officers) amongst several groups, in order to maximize some objective (loans given that are repaid or criminals that are apprehended). Often in such problems fairness is also a concern. A natural notion of fairness, based on general principles of equality of opportunity, asks that conditional on an individual being a candidate for the resource, the probability of actually receiving it is approximately independent of the individual's group. In lending this means that equally creditworthy individuals in different racial groups have roughly equal chances of receiving a loan. In policing it means that two individuals committing the same crime in different districts would have roughly equal chances of being arrested. #R##N#We formalize this fairness notion for allocation problems and investigate its algorithmic consequences. Our main technical results include an efficient learning algorithm that converges to an optimal fair allocation even when the frequency of candidates (creditworthy individuals or criminals) in each group is unknown. The algorithm operates in a censored feedback model in which only the number of candidates who received the resource in a given allocation can be observed, rather than the true number of candidates. This models the fact that we do not learn the creditworthiness of individuals we do not give loans to nor learn about crimes committed if the police presence in a district is low. #R##N#As an application of our framework, we consider the predictive policing problem. The learning algorithm is trained on arrest data gathered from its own deployments on previous days, resulting in a potential feedback loop that our algorithm provably overcomes. We empirically investigate the performance of our algorithm on the Philadelphia Crime Incidents dataset.

Includes members:
  Member "delayed impact of fair machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "demographic bias in biometrics a survey on an emerging challenge")
  Member "a smoothed analysis of the greedy algorithm for the linear contextual bandit problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "algorithmic fairness")
  Member "fair clustering through fairlets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "algorithmic fairness")
  Member "the externalities of exploration and how data diversity helps exploitation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "incentivizing exploration with selective data disclosure")
  Member "fairness under composition":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "algorithmic fairness")
  Member "a convex framework for fair regression":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "algorithmic fairness")
  Member "learning non discriminatory predictors":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "algorithmic fairness")
  Member "algorithmic decision making and the cost of fairness":
    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.LG(Machine Learning)