A Quality Assuring Multi-armed Bandit Crowdsourcing M echanism with Incentive Compatible Learning (Extended Abstract)
暂无分享,去创建一个
We develop a novel multi-armed bandit (MAB) mechanism for the problem of selecting a subset of crowd workers to achieve an assured accuracy for each binary labelling task in a cost optimal way. This problem is challenging because workers have unknown qualities and strategic costs.
[1] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[2] Moshe Babaioff,et al. Truthful mechanisms with implicit payment computation , 2010, EC '10.