论文标题
长期参与众包的两阶段拍卖机制
Two-Stage Auction Mechanism for Long-Term Participation in Crowdsourcing
论文作者
论文摘要
众包已成为为各种人工智能应用收集数据的重要工具,拍卖可以是分配工作并确定众包平台上奖励的有效方法。在本文中,我们专注于小型任务的众包,例如图像标签和语音记录,我们面临许多挑战。首先,工人对他们愿意做的工作数量有不同的限制,他们也可能会在竞标工作中误导这些限制。其次,如果随着时间的推移重复拍卖,则失败的工人可能会退出系统,从而减少竞争和多样性。为了解决这些问题,我们首先将著名的迈尔森最佳拍卖机制的结果扩展到单参数竞标的情况下,竞标包括单位工作成本,最大的工作量,一个人愿意做的最大工作量以及完成的实际工作。我们表明,一种简单的付款机制足以确保工人的主导策略,并且这种主导策略对工人的真正实用功能是有力的。其次,我们提出了一种新颖的灵活的工作分配机制,该机制使请求者能够在成本效率和平等之间取得平衡。尽管成本最小化显然很重要,但鼓励分配工作的平等增加了劳动力的多样性,并促进了对众包平台的长期参与。我们的主要结果将在分析中证明并通过模拟验证。
Crowdsourcing has become an important tool to collect data for various artificial intelligence applications and auction can be an effective way to allocate work and determine reward in a crowdsourcing platform. In this paper, we focus on the crowdsourcing of small tasks such as image labelling and voice recording where we face a number of challenges. First, workers have different limits on the amount of work they would be willing to do, and they may also misreport these limits in their bid for work. Secondly, if the auction is repeated over time, unsuccessful workers may drop out of the system, reducing competition and diversity. To tackle these issues, we first extend the results of the celebrated Myerson's optimal auction mechanism for a single-parameter bid to the case where the bid consists of the unit cost of work, the maximum amount of work one is willing to do, and the actual work completed. We show that a simple payment mechanism is sufficient to ensure a dominant strategy from the workers, and that this dominant strategy is robust to the true utility function of the workers. Secondly, we propose a novel, flexible work allocation mechanism, which allows the requester to balance between cost efficiency and equality. While cost minimization is obviously important, encouraging equality in the allocation of work increases the diversity of the workforce as well as promotes long-term participation on the crowdsourcing platform. Our main results are proved analytically and validated through simulations.