Incentive Mechanism Design for Crowdsourcing: An All-pay Auction Approach

Crowdsourcing can be modeled as a principal-agent problem in which the principal (crowdsourcer) desires to solicit maximal contribution from a group of agents (participants) while agents are only motivated to act to their own respective advantages. To reconcile this tension, we propose an all-pay au...

Full description

Saved in:
Bibliographic Details
Main Authors: LUO, Tie, DAS, Sajal K., Hwee-Pink TAN, XIA, Lirong
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2016
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/2878
https://ink.library.smu.edu.sg/context/sis_research/article/3878/viewcontent/ACMTIST2015.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-3878
record_format dspace
spelling sg-smu-ink.sis_research-38782017-09-11T03:10:08Z Incentive Mechanism Design for Crowdsourcing: An All-pay Auction Approach LUO, Tie DAS, Sajal K. Hwee-Pink TAN, XIA, Lirong Crowdsourcing can be modeled as a principal-agent problem in which the principal (crowdsourcer) desires to solicit maximal contribution from a group of agents (participants) while agents are only motivated to act to their own respective advantages. To reconcile this tension, we propose an all-pay auction approach to incentivize agents to act in the principal's interst, i.e., maximizing profit, while allowing agents to reap strictly positive utility. Our rationale for advocating all-pay auctions is based on two merits that we identify, namely all-pay auctions (i) compress the common, two-stage "bid-contribute" crowdsourcing process into a single "bid-cum-contribute" stage, and (ii) eliminate the risk of task non-fulfillment. In our proposed approach, we enhance all-pay auctions with two additional features: an adaptive prize and a general crowdsourcing environment. The prize or reward adapts itself as per a function of the unknown winning agent's contribution, and the environment or setting generally accomodates incomplete and asymmetric information, risk-averse as well as risk-neutral agents, and stochastic as well as deterministic population. We analytically derive this all-pay auction based mechanism, and extensively evaluate it in comparison to classic and optimized mechanisms. The results demonstrate that our proposed approach remarkably outperforms its counterparts in terms of principal's profit, agent's utility and social welfare. 2016-04-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/2878 info:doi/10.1145/2837029 https://ink.library.smu.edu.sg/context/sis_research/article/3878/viewcontent/ACMTIST2015.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Bayesian Nash equilibrium Mobile crowd sensing shading effect participatory sensing incomplete information risk aversion Computer Sciences Software Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Bayesian Nash equilibrium
Mobile crowd sensing
shading effect
participatory sensing
incomplete information
risk aversion
Computer Sciences
Software Engineering
spellingShingle Bayesian Nash equilibrium
Mobile crowd sensing
shading effect
participatory sensing
incomplete information
risk aversion
Computer Sciences
Software Engineering
LUO, Tie
DAS, Sajal K.
Hwee-Pink TAN,
XIA, Lirong
Incentive Mechanism Design for Crowdsourcing: An All-pay Auction Approach
description Crowdsourcing can be modeled as a principal-agent problem in which the principal (crowdsourcer) desires to solicit maximal contribution from a group of agents (participants) while agents are only motivated to act to their own respective advantages. To reconcile this tension, we propose an all-pay auction approach to incentivize agents to act in the principal's interst, i.e., maximizing profit, while allowing agents to reap strictly positive utility. Our rationale for advocating all-pay auctions is based on two merits that we identify, namely all-pay auctions (i) compress the common, two-stage "bid-contribute" crowdsourcing process into a single "bid-cum-contribute" stage, and (ii) eliminate the risk of task non-fulfillment. In our proposed approach, we enhance all-pay auctions with two additional features: an adaptive prize and a general crowdsourcing environment. The prize or reward adapts itself as per a function of the unknown winning agent's contribution, and the environment or setting generally accomodates incomplete and asymmetric information, risk-averse as well as risk-neutral agents, and stochastic as well as deterministic population. We analytically derive this all-pay auction based mechanism, and extensively evaluate it in comparison to classic and optimized mechanisms. The results demonstrate that our proposed approach remarkably outperforms its counterparts in terms of principal's profit, agent's utility and social welfare.
format text
author LUO, Tie
DAS, Sajal K.
Hwee-Pink TAN,
XIA, Lirong
author_facet LUO, Tie
DAS, Sajal K.
Hwee-Pink TAN,
XIA, Lirong
author_sort LUO, Tie
title Incentive Mechanism Design for Crowdsourcing: An All-pay Auction Approach
title_short Incentive Mechanism Design for Crowdsourcing: An All-pay Auction Approach
title_full Incentive Mechanism Design for Crowdsourcing: An All-pay Auction Approach
title_fullStr Incentive Mechanism Design for Crowdsourcing: An All-pay Auction Approach
title_full_unstemmed Incentive Mechanism Design for Crowdsourcing: An All-pay Auction Approach
title_sort incentive mechanism design for crowdsourcing: an all-pay auction approach
publisher Institutional Knowledge at Singapore Management University
publishDate 2016
url https://ink.library.smu.edu.sg/sis_research/2878
https://ink.library.smu.edu.sg/context/sis_research/article/3878/viewcontent/ACMTIST2015.pdf
_version_ 1770572662243852288