论文标题
通过战略分类中的审计激励真实性
Incentivizing Truthfulness Through Audits in Strategic Classification
论文作者
论文摘要
在许多社会资源分配域中,机器学习方法越来越多地用于评分或排名代理,以确定哪些应该从社会服务机构那里获得资源(例如,无家可归的服务)或审查(例如儿童福利调查)。代理商的评分功能通常在功能向量上运行,该功能矢量包含了自我报告的功能和信息的组合,可以向代理机构提供有关个人或家庭的信息。这可以为代理商提供激励措施,以使代理商误解其自我报告的功能,以获得资源或避免进行审查,但代理商可能会选择审核代理商来验证其报告的效率。 我们研究了在这种情况下对代理商进行最佳审核的问题。当使用代理分数的阈值做出决定时,最佳审计政策具有令人惊讶的简单结构,统一审核所有可以从说谎中受益的代理商。尽管通常很难确定可以从撒谎中受益的代理集,但总的来说,这项政策很难计算,但我们还提供了可进行的必要和充分条件。我们表明,稀缺的资源设置更加困难,在这种情况下,大致表现出最佳的审计政策。此外,我们表明,在验证是否有可能激励确切的真实性甚至很难近似的情况下。但是,我们还表现出足够的条件,可以最佳地解决此问题,并获得良好的近似值。
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.