Sciweavers

Share
ATAL
2015
Springer

A Truthful Budget Feasible Multi-Armed Bandit Mechanism for Crowdsourcing Time Critical Tasks

3 years 7 months ago
A Truthful Budget Feasible Multi-Armed Bandit Mechanism for Crowdsourcing Time Critical Tasks
Motivated by allocation and pricing problems faced by service requesters on modern crowdsourcing platforms, we study a multi-armed bandit (MAB) problem with several realworld features: (a) the requester wishes to crowdsource a number of tasks but has a fixed budget which leads to a trade-off between cost and quality while allocating tasks to workers; (b) each task has a fixed deadline and a worker who is allocated a task is not available until this deadline; (c) the qualities (probability of completing a task successfully within deadline) of crowd workers are not known; and (d) the crowd workers are strategic about their costs. We propose a mechanism that maximizes the expected number of successfully completed tasks, assuring budget feasibility, incentive compatibility, and individual rationality. We establish an upper bound of O(B2/3 (K ln(KB))1/3 ) on the expected regret of the proposed mechanism with respect to an appropriate benchmark algorithm, where B is the total budget and ...
Arpita Biswas, Shweta Jain, Debmalya Mandal, Y. Na
Added 16 Apr 2016
Updated 16 Apr 2016
Type Journal
Year 2015
Where ATAL
Authors Arpita Biswas, Shweta Jain, Debmalya Mandal, Y. Narahari
Comments (0)
books