Pith. sign in

REVIEW

Crowdsourcing Dilemma

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1304.3548 v3 pith:NYWNQZCP submitted 2013-04-12 cs.SI cs.GTphysics.soc-ph

classification cs.SIcs.GTphysics.soc-ph
keywords crowdsourcingbehaviorcompetitionsmaliciouspotentialanalysisanomaly---aarea
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Crowdsourcing offers unprecedented potential for solving tasks efficiently by tapping into the skills of large groups of people. A salient feature of crowdsourcing---its openness of entry---makes it vulnerable to malicious behavior. Such behavior took place in a number of recent popular crowdsourcing competitions. We provide game-theoretic analysis of a fundamental tradeoff between the potential for increased productivity and the possibility of being set back by malicious behavior. Our results show that in crowdsourcing competitions malicious behavior is the norm, not the anomaly---a result contrary to the conventional wisdom in the area. Counterintuitively, making the attacks more costly does not deter them but leads to a less desirable outcome. These findings have cautionary implications for the design of crowdsourcing competitions.

Discussion (0). Continue with ORCID to comment.

Pith tools