A network based mechanism for managing decomposable tasks via crowdsourcing

Sankar Kumar Mridha () and Malay Bhattacharyya ()
Additional contact information
Sankar Kumar Mridha: Indian Institute of Engineering Science and Technology
Malay Bhattacharyya: Indian Institute of Engineering Science and Technology

Electronic Commerce Research, 2018, vol. 18, issue 4, No 9, 869-881

Abstract: Abstract If a task is decomposable in a competitive crowdsourcing environment, thereby allowing collaboration, rational workers may choose to divide it into multiple sub-tasks among themselves. But as the winners are selected independently, there is no benefit out of this decomposition. We show that by the appropriate combination of such decomposed solutions, obtained from multiple workers, we can achieve a better solution for a given task. We present a network based mechanism to choose the best mixture of sub-tasks in a competitive environment for selecting collaborating winners.

Keywords: Decomposable task; Competitive crowdsourcing; Network model (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10660-018-9317-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:elcore:v:18:y:2018:i:4:d:10.1007_s10660-018-9317-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10660

DOI: 10.1007/s10660-018-9317-8

Access Statistics for this article

Electronic Commerce Research is currently edited by James Westland

More articles in Electronic Commerce Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().