Pith. sign in

REVIEW 1 cited by

Hiring Fairly in the Age of Algorithms

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.07132 v1 pith:OKD2YBWC submitted 2020-04-15 cs.HC cs.CY

classification cs.HCcs.CY
keywords hiringemployerstransparencyalgorithmicalgorithmsautomatedemploymentexisting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Widespread developments in automation have reduced the need for human input. However, despite the increased power of machine learning, in many contexts these programs make decisions that are problematic. Biases within data and opaque models have amplified human prejudices, giving rise to such tools as Amazon's (now defunct) experimental hiring algorithm, which was found to consistently downgrade resumes when the word "women's" was added before an activity. This article critically surveys the existing legal and technological landscape surrounding algorithmic hiring. We argue that the negative impact of hiring algorithms can be mitigated by greater transparency from the employers to the public, which would enable civil advocate groups to hold employers accountable, as well as allow the U.S. Department of Justice to litigate. Our main contribution is a framework for automated hiring transparency, algorithmic transparency reports, which employers using automated hiring software would be required to publish by law. We also explain how existing regulations in employment and trade secret law can be extended by the Equal Employment Opportunity Commission and Congress to accommodate these reports.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Fairness and Sparsity within Rashomon sets: Enumeration-Free Exploration and Characterization

    cs.LG 2025-02 conditional novelty 6.0 of 10

    A mathematical programming framework exactly bounds achievable fairness within performance-constrained Rashomon sets under sparsity constraints, applied to scoring systems and decision diagrams.

Pith tools