Adaptive contract design for crowdsourcing markets
Authors:
Open Access
- 1 June 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 359-376
Abstract
Crowdsourcing markets have emerged as a popular platform for matching available workers with tasks to complete. The payment for a particular task is typically set by the task's requester, and may be adjusted based on the quality of the completed work, for example, through the use of 'bonus' payments. In this paper, we study the requester's problem of dynamically adjusting quality-contingent payments for tasks. We consider a multi-round version of the well-known principal-agent model, whereby in each round a worker makes a strategic choice of the effort level which is not directly observable by the requester. In particular, our formulation significantly generalizes the budget-free online task pricing problems studied in prior work. We treat this problem as a multi-armed bandit problem, with each 'arm' representing a potential contract. To cope with the large (and in fact, infinite) number of arms, we propose a new algorithm, AgnosticZooming, which discretizes the contract space into a finite number of regions, effectively treating each region as a single arm. This discretization is adaptively refined, so that more promising regions of the contract space are eventually discretized more finely. We provide a full analysis of this algorithm, showing that it achieves regret sublinear in the time horizon and substantially improves over non-adaptive discretization (which is the only competing approach in the literature).Keywords
Funding Information
- Division of Information and Intelligent Systems (IIS-1054911)
This publication has 11 references indexed in Scilit:
- Bandits with Knapsacks2013
- Pricing mechanisms for crowdsourcing markets2013
- Learning on a budget2012
- Multi-armed bandits in metric spaces2008
- Learning diverse rankings with multi-armed bandits2008
- Bandits for Taxonomies: A Model-based Approach2007
- Bandit Based Monte-Carlo Planning2006
- The Theory of Incentives2002
- Finite-time Analysis of the Multiarmed Bandit ProblemMachine Learning, 2002
- The Continuum-Armed Bandit ProblemSIAM Journal on Control and Optimization, 1995