Algorithms for strategyproof classification

作者:

摘要

The strategyproof classification problem deals with a setting where a decision maker must classify a set of input points with binary labels, while minimizing the expected error. The labels of the input points are reported by self-interested agents, who might lie in order to obtain a classifier that more closely matches their own labels, thereby creating a bias in the data; this motivates the design of truthful mechanisms that discourage false reports.

论文关键词:Mechanism design,Classification,Game theory,Approximation

论文评审过程:Received 25 September 2011, Revised 12 March 2012, Accepted 26 March 2012, Available online 27 March 2012.

论文官网地址:https://doi.org/10.1016/j.artint.2012.03.008