Abstract
Competitive crowdsourcing is a popular strategic model for solving tasks in an efficient economical way. Competitive crowdsourcing platforms generally choose the winners for a single indivisible task following the conventional Dutch auction to minimize the cost. In this paper, we show that when the tasks are decomposable such mechanisms become biased for competitive crowdsourcing markets. As a solution to this, we suggest a variant of the Dutch auction (referred to as time-invariant Dutch auction) for solving decomposable tasks. Overall, some new insights about the mechanism design for competitive crowdsourcing markets are obtained.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
