Incentivizing Truthfulness Through Audits in Strategic Classification

12/16/2020
by   Andrew Estornell, et al.
0

In many societal resource allocation domains, machine learning methods are increasingly used to either score or rank agents in order to decide which ones should receive either resources (e.g., homeless services) or scrutiny (e.g., child welfare investigations) from social services agencies. An agency's scoring function typically operates on a feature vector that contains a combination of self-reported features and information available to the agency about individuals or households.This can create incentives for agents to misrepresent their self-reported features in order to receive resources or avoid scrutiny, but agencies may be able to selectively audit agents to verify the veracity of their reports. We study the problem of optimal auditing of agents in such settings. When decisions are made using a threshold on an agent's score, the optimal audit policy has a surprisingly simple structure, uniformly auditing all agents who could benefit from lying. While this policy can, in general, be hard to compute because of the difficulty of identifying the set of agents who could benefit from lying given a complete set of reported types, we also present necessary and sufficient conditions under which it is tractable. We show that the scarce resource setting is more difficult, and exhibit an approximately optimal audit policy in this case. In addition, we show that in either setting verifying whether it is possible to incentivize exact truthfulness is hard even to approximate. However, we also exhibit sufficient conditions for solving this problem optimally, and for obtaining good approximations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2011

Resource Allocation Among Agents with MDP-Induced Preferences

Allocating scarce resources among agents to maximize global utility is, ...
research
09/25/2022

Online Allocation and Learning in the Presence of Strategic Agents

We study the problem of allocating T sequentially arriving items among n...
research
05/25/2022

Uniformly Bounded Regret in Dynamic Fair Allocation

We study a dynamic allocation problem in which T sequentially arriving d...
research
07/31/2017

Pricing for Online Resource Allocation: Beyond Subadditive Values

We consider the problem of truthful online resource allocation to maximi...
research
10/25/2021

Self-aware Social Learning over Graphs

In this paper we study the problem of social learning under multiple tru...
research
11/27/2022

Strategically revealing capabilities in General Lotto games

Can revealing one's competitive capabilities to an opponent offer strate...
research
06/11/2018

The Influence of One Strategic Agent on The Matching Market

Consider a matching problem with n men and n women, with preferences dra...

Please sign up or login with your details

Forgot password? Click here to reset