Verification in referral-based crowdsourcing
Naroditskiy, Victor, Rahwan, Iyad, Cebrian, Manuel and Jennings, Nicholas R. (2012) Verification in referral-based crowdsourcing. PLoS ONE, 7, (10), e45924. (doi:10.1371/journal.pone.0045924).
Online social networks offer unprecedented potential for rallying a large number of people to accomplish a given task. Here we focus on information gathering tasks where rare information is sought through "referral-based crowdsourcing": the information request is propagated recursively through invitations among members of a social network. Whereas previous work analyzed incentives for the referral process in a setting with only correct reports, misreporting is known to be both pervasive in crowdsourcing applications, and difficult/costly to filter out. A motivating example for our work is the DARPA Red Balloon Challenge where the level of misreporting was very high. In order to undertake a formal study of verification, we introduce a model where agents can exert costly effort to perform verification and false reports can be penalized. This is the first model of verification and it provides many directions for future research, which we point out. Our main theoretical result is the compensation scheme that minimizes the cost of retrieving the correct answer. Notably, this optimal compensation scheme coincides with the winning strategy of the Red Balloon Challenge.
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Agents, Interactions & Complexity
|Date Deposited:||14 Sep 2012 10:03|
|Last Modified:||26 Apr 2013 07:00|
|Contributors:||Naroditskiy, Victor (Author)
Rahwan, Iyad (Author)
Cebrian, Manuel (Author)
Jennings, Nicholas R. (Author)
|Date:||10 October 2012|
|Further Information:||Google Scholar|
|ISI Citation Count:||1|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)