Pith. sign in

REVIEW

Manipulation-Proof Machine Learning

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.03865 v1 pith:IUWH5RSP submitted 2020-04-08 econ.TH cs.LGecon.EM

classification econ.THcs.LGecon.EM
keywords decisiondecisionslearningrulesbehaviorestimatormachinestable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

An increasing number of decisions are guided by machine learning algorithms. In many settings, from consumer credit to criminal justice, those decisions are made by applying an estimator to data on an individual's observed behavior. But when consequential decisions are encoded in rules, individuals may strategically alter their behavior to achieve desired outcomes. This paper develops a new class of estimator that is stable under manipulation, even when the decision rule is fully transparent. We explicitly model the costs of manipulating different behaviors, and identify decision rules that are stable in equilibrium. Through a large field experiment in Kenya, we show that decision rules estimated with our strategy-robust method outperform those based on standard supervised learning approaches.

Discussion (0). Continue with ORCID to comment.

Pith tools