The importance of being earnest in crowdsourcing systems

Proceedings - IEEE INFOCOM

Volumn 26, Issue , 2015, Pages 2821-2829

  Tarable, Alberto ^a   Nordio, Alessandro ^a   Leonardi, Emilio ^b   Marsan, Marco Ajmone ^a,b,c  

^a CNR   (Italy)

^b POLITECNICO DI TORINO   (Italy)

^c IMDEA NETWORKS INSTITUTE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

CROWDSOURCING; DECISION RULES; GREEDY HEURISTICS; MAXIMUM A POSTERIORI; OPTIMAL PROBLEMS; PERFORMANCE GAIN; TASK ALLOCATION ALGORITHM; TASK ASSIGNMENT;

OPTIMIZATION;

EID: 84954498339     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2015.7218675     Document Type: Conference Paper

References (17)

1. M.-C. Yuen, I. King, K.-S. Leung, "A Survey of Crowdsourcing Systems, " IEEE PASSAT-SOCIALCOM, Boston (USA), Oct. 2011.
2. A. Kittur, J. V. Nickerson, M. Bernstein, E. Gerber, A. Shaw, J. Zimmerman, M. Lease, J. Horton, "The future of crowd work, " ACM CSCW '13, New York (USA), 2013.
3. E. Christoforou, A. Fernandez Anta, C. Georgiou, M. A. Mosteiro, A. Sanchez, "Applying the dynamics of evolution to achieve reliability in master-worker computing, " Concurrency and Computation: Practice and Experience vol. 25, n. 17, pp. 2363-2380, 2013.
4. A. Fernandez Anta, C. Georgiou, M. A. Mosteiro, "Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers, " IEEE IPDPS 2010, Atlanta (USA), 2010.
5. A. Fernandez Anta, C. Georgiou, L. Lopez, A. Santos, "Reliable internet-based master-worker computing in the presence of malicious workers, " Parallel Processing Letters, vol. 22, n. 1, 2012.
6. A. Singla, A. Krause, "Truthful incentives in crowdsourcing tasks using regret minimization mechanisms, " WWW '13, Rio de Janeiro (Brazil), 2013.
7. E. Kamar, E. Horvitz, "Incentives for truthful reporting in crowdsourcing, " AAMAS '12, Valencia (Spain), 2012.
8. P. Donmez, J. G. Carbonell, J. Schneider, "Efficiently learning the accuracy of labeling sources for selective sampling, " ACM KDD '09, New York (USA), 2009.
9. Y. Zheng, S. Scott, K. Deng, "Active learning from multiple noisy labelers with varied costs, " IEEE ICDM 2010, Sydney (Australia), 2010.
10. D. R. Karger, S. Oh, D. Shah, "Budget-optimal Crowdsourcing Using Low-rank Matrix Approximations, " 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 284, 291, 28-30 Sept. 2011.
11. D. R. Karger, S. Oh, D. Shah, "Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems, " Operations Research vol. 62, no. 1, pp. 1-24, 2014.
12. D. R. Karger, S. Oh, D. Shah, "Efficient crowdsourcing for multi-class labeling, " ACM SIGMETRICS, Pittsburgh (USA), 2013.
13. I. Abraham, O. Alonso, V. Kandylas, A. Slivkins, "Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem, " arXiv: 1302. 3268.
14. A. Ghosh, S. Kale, P. McAfee, "Who moderates the moderators?: crowdsourcing abuse detection in user-generated content, " ACM EC '11, New York (USA).
15. T. M. Cover, J. M. Thomas, Elements of information theory, 2nd ed., John Wiley, 2005.
16. G. Calinescu, C. Chekuri, M. Pl, J. Vondrk, "Maximizing a Monotone Submodular Function Subject to a Matroid Constraint, " SIAM Journal on Computing, vol. 40, n. 6, pp. 1740-1766, 2011.
17. Technical Report http: //arxiv. org/pdf/1411. 7960v1. pdf