On Dynamically Pricing Crowdsourcing Tasks

Author:

Miao Xiaoye1ORCID,Peng Huanhuan1ORCID,Gao Yunjun2ORCID,Zhang Zongfu3ORCID,Yin Jianwei4ORCID

Affiliation:

1. Center for Data Science, Zhejiang University, Zhejiang, China

2. College of Computer Science, Zhejiang University, Zhejiang, China

3. Suzhou Fanhan, Jiangsu, China

4. College of Computer Science, Center for Data Science, Zhejiang University, Zhejiang, China

Abstract

Crowdsourcing techniques have been extensively explored in the past decade, including task allocation, quality assessment, and so on. Most of professional crowdsourcing platforms adopt the fixed pricing scheme to offer a fixed price for crowd tasks. It is neither incentive for crowd workers to produce good performance, nor profitable for the requester to gain high utility with low budget. In this article, we study the problem of pricing crowdsourcing tasks with optional bonuses. We propose a dynamic pricing mechanism, named CrowdPricer for incentively delivering bonuses to the crowd workers of completing tasks, in addition to offering a base payment for completing a task. We leverage a deep time sequence model to learn the effect of bonuses on workers’ quality for crowd tasks. CrowdPricer makes decisions on whether to provide bonuses on workers, so as to maximize the requester’s utility in expectation. We present an efficient bonus delivery algorithm under the help of beam search technique, in order to efficiently solve the decision making problem. Extensive experiments using both a real crowdsourcing platform and simulations demonstrate that CrowdPricer yields the higher utility for the requester. It also obtains more correct crowd answers than the state-of-the-art pricing methods.

Funder

NSFC

Zhejiang Provincial Natural Science Foundation

Fundamental Research Funds for the Central Universities

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Reference86 articles.

1. Yasin Abbasi-Yadkori, Peter L. Bartlett, Xi Chen, and Alan Malek. 2015. Large-scale Markov decision problems with KL control cost and its application to Crowdsourcing. In Proceedings of the 32nd International Conference on International Conference on Machine Learning. 1053–1062.

2. A Time-Series-Based New Behavior Trace Model for Crowd Workers That Ensures Quality Annotation

3. Crowdsensing Data Trading based on Combinatorial Multi-Armed Bandit and Stackelberg Game

4. Data markets in the cloud

5. Crowdsourcing Translation by Leveraging Tournament Selection and Lattice-Based String Alignment

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3