Auction Based Mechanisms for Dynamic Task Assignments in Expert Crowdsourcing

Crowdsourcing marketplaces link large populations of workers to an even larger number of tasks. Thus, it is necessary to have mechanisms for matching workers with interesting and suitable tasks. Earlier work has addressed the problem of finding optimal workers for a given set of tasks. However, workers also have preferences and will stay with a platform only if it gives them interesting tasks. We therefore analyze several matching mechanisms that take into account workers' preferences as well. We propose that the workers pay premiums to get preferred matches and auction-based models where preferences are expressed through variations of the payment for a task. We analyze the properties of two matching different mechanisms: Split Dynamic VCG (SDV) and e-Auction. We compare both the mechanisms with Arrival Priority Serial Dictatorship (APSD) empirically for efficiency.


Editor(s):
Ceppi, S
David, E
Hajaj, C
Robu, V
Vetsikas, Ia
Published in:
Agent-Mediated Electronic Commerce: Designing Trading Strategies And Mechanisms For Electronic Markets, 271, 50-65
Presented at:
2nd Workshop on Agent-Mediated Electronic Commerce and Trading Agent Design and Analysis (AMEC/TADA), New York, NY, JUL 10-AUG 20, 2016
Year:
2017
Publisher:
Cham, Springer International Publishing Ag
ISSN:
1865-1348
ISBN:
978-3-319-54229-4
978-3-319-54228-7
Laboratories:




 Record created 2017-12-04, last modified 2018-05-03


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)