Optimal crowdsourcing contests

• 成果类型: Article
• 署名作者: Chawla, Shuchi; Hartline, Jason D.; Sivan, Balasubramanian
• 署名单位: University of Wisconsin System; University of Wisconsin Madison; Northwestern University
• 刊物名称: GAMES AND ECONOMIC BEHAVIOR
• ISSN/ISSBN: 0899-8256
• DOI: 10.1016/j.geb.2015.09.001
• 发表日期: 2019
• 页码: 80-96
• 关键词: Crowdsourcing contest; all-pay auction; Bayes-Nash equilibrium; approximation

摘要

We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to enter. Unlike all-pay auctions where a usual design objective would be to maximize revenue, in crowdsourcing contests, the principal only benefits from the submission with the highest quality. We give a theory for optimal crowdsourcing contests that mirrors the theory of optimal auction design: the optimal crowdsourcing contest is a virtual valuation optimizer (the virtual valuation function depends on the distribution of contestant skills and the number of contestants). We also compare crowdsourcing contests with more conventional means of procurement. In this comparison, crowdsourcing contests are relatively disadvantaged because the effort of losing contestants is wasted. We show that the total wasted effort is at most the maximum effort which implies that crowdsourcing contests are a 2-approximation to an idealized model of conventional procurement. (C) 2015 Elsevier Inc. All rights reserved.