The Complexity of Crowdsourcing : Theoretical Problems in Human Computation

  • Kulkarni A
N/ACitations
Citations of this article
82Readers
Mendeley users who have this article in their library.

Abstract

What does theoretical computer science have to say about human computation? We identify three problems at the intersection of crowdsourcing, operations research, and theoretical computer science whose solution would have a major impact on the design, evaluation, and construction of real crowdsourcing systems. In some cases, these problems can let us sidestep apparently difficult HCI challenges by making appropriate choices at the algorithmic level. In other contexts, theoretical tools provide a formal basis for evaluating the performance of algorithms and classifying the difficulty of tasks in crowdsourcing. Our problems are illustrated through two recent projects. The first, Turkomatic, is an attempt to construct a “universal” algorithm for generating workflows on microtask crowdsourcing platforms. The second, MobileWorks, is a new crowdsourcing engine designed from the bottom up to provide appropriate abstractions between the theoretical elements of human computation systems and interface/design questions. It is hoped that this analysis can spur the development of theoretical frameworks for understanding algorithms involving human computation.

Cite

CITATION STYLE

APA

Kulkarni, A. (2011). The Complexity of Crowdsourcing : Theoretical Problems in Human Computation. In 29th ACM Conference on Human Factors in Computing Systems Workshop on Crowdsourcing and Human Computation (p. 4). Retrieved from https://pdfs.semanticscholar.org/150b/0def862ddc6e57a1fd6acdc59c257c1ae1be.pdf http://crowdresearch.org/chi2011-workshop/papers/kulkarni.pdf

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free