{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T03:43:02Z","timestamp":1774496582858,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T00:00:00Z","timestamp":1533772800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"MeitY, Government of India","award":["Visvesvaraya Young Faculty Research Fellowship 2015-16"],"award-info":[{"award-number":["Visvesvaraya Young Faculty Research Fellowship 2015-16"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Electron Commer Res"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10660-018-9317-8","type":"journal-article","created":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T16:25:09Z","timestamp":1533831909000},"page":"869-881","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A network based mechanism for managing decomposable tasks via crowdsourcing"],"prefix":"10.1007","volume":"18","author":[{"given":"Sankar Kumar","family":"Mridha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7781-1264","authenticated-orcid":false,"given":"Malay","family":"Bhattacharyya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"key":"9317_CR1","unstructured":"Amazon mechanical turk. https:\/\/www.mturk.com . Accessed June 2017."},{"key":"9317_CR2","unstructured":"Freelancer. https:\/\/www.freelancer.in . Accessed June 2017."},{"key":"9317_CR3","unstructured":"99designs. https:\/\/99designs.com . Accessed June 2017."},{"key":"9317_CR4","unstructured":"Flightfox. https:\/\/www.flightfox.com . Accessed June 2017."},{"issue":"2","key":"9317_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1869086.1869094","volume":"17","author":"PG Ipeirotis","year":"2010","unstructured":"Ipeirotis, P. G. (2010). Analyzing the amazon mechanical turk marketplace. XRDS: Crossroads, The ACM Magazine for Students, 17(2), 16\u201321.","journal-title":"XRDS: Crossroads, The ACM Magazine for Students"},{"key":"9317_CR6","doi-asserted-by":"crossref","unstructured":"Ross, J, Irani, L, Silberman, M. S., Zaldivar, A. & Tomlinson, B. (2010). Who are the crowdworkers?: Shifting demographics in mechanical turk. Atlanta, Georgia, USA, April 10\u201315.","DOI":"10.1145\/1753846.1753873"},{"issue":"2","key":"9317_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1869086.1869096","volume":"17","author":"A Kittur","year":"2010","unstructured":"Kittur, A. (2010). Crowdsourcing, collaboration and creativity. XRDS: Crossroads, the ACM magazine for students, 17(2), 22\u201326.","journal-title":"XRDS: Crossroads, the ACM magazine for students"},{"key":"9317_CR8","doi-asserted-by":"crossref","unstructured":"Pan, Z., Yu, H., Miao, C., & Leung, C. (2016). Efficient collaborative crowdsourcing. In AAAI (pp. 4248\u20134249).","DOI":"10.1609\/aaai.v30i1.9941"},{"issue":"5","key":"9317_CR9","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1287\/mnsc.1110.1322","volume":"57","author":"KJ Boudreau","year":"2011","unstructured":"Boudreau, K. J., Lacetera, N., & Lakhani, K. L. (2011). Incentives and problem uncertainty in innovation contests: An empirical analysis. Management Science, 57(5), 843\u2013863.","journal-title":"Management Science"},{"issue":"4","key":"9317_CR10","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1924421.1924441","volume":"54","author":"JC Tang","year":"2011","unstructured":"Tang, J. C., Cebrian, M., Giacobe, N. A., Kim, H.-W., Kim, T., & Wickert, D. B. (2011). Reflecting on the DARPA red balloon challenge. Communications of the ACM, 54(4), 78.","journal-title":"Communications of the ACM"},{"key":"9317_CR11","doi-asserted-by":"crossref","unstructured":"Nima Anari, Gagan Goel, & Afshin Nikzad. (2014). Mechanism design for crowdsourcing: An optimal 1-1\/e competitive budget-feasible mechanism for large markets. In Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on (pp. 266\u2013275). IEEE.","DOI":"10.1109\/FOCS.2014.36"},{"key":"9317_CR12","unstructured":"Yang, Y, & Saremi, R. (2015). Award vs. worker behaviors in competitive crowdsourcing tasks. In Empirical Software Engineering and Measurement (ESEM), 2015 ACM\/IEEE International Symposium on (pp. 1\u201310). IEEE."},{"issue":"1","key":"9317_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.15346\/hc.v4i1.4","volume":"4","author":"SK Mridha","year":"2017","unstructured":"Mridha, S. K., & Bhattacharyya, M. (2017). Is dutch auction suitable for decomposable tasks in competitive crowdsourcing markets? Human Computation, 4(1), 71\u201377.","journal-title":"Human Computation"},{"key":"9317_CR14","doi-asserted-by":"crossref","unstructured":"Goel, G., Nikzad, A., & Singla, A. (2014). Mechanism design for crowdsourcing markets with heterogeneous tasks. In Second AAAI Conference on Human Computation and Crowdsourcing.","DOI":"10.1609\/hcomp.v2i1.13158"},{"issue":"4","key":"9317_CR15","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.is.2012.09.003","volume":"38","author":"B Satzger","year":"2013","unstructured":"Satzger, B., Psaier, H., Schall, D., & Dustdar, S. (2013). Auction-based crowdsourcing supporting skill management. Information Systems, 38(4), 547\u2013560.","journal-title":"Information Systems"},{"key":"9317_CR16","doi-asserted-by":"crossref","unstructured":"Yang, D., Xue, G., Fang, X., & Tang, J. (2012). Crowdsourcing to smartphones: Incentive mechanism design for mobile phone sensing. In Proceedings of the 18th Annual International Conference on Mobile Computing And Networking (pp. 173\u2013184). Istanbul Turkey, August 22\u201326.","DOI":"10.1145\/2348543.2348567"},{"key":"9317_CR17","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Kleinberg, R., & Singer, Y. (2012). Learning on a budget: Posted price mechanisms for online procurement. In Proceedings of the 13th ACM Conference on Electronic Commerce (pp. 128\u2013145). Valenca, Spain, June 4\u20138.","DOI":"10.1145\/2229012.2229026"},{"key":"9317_CR18","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J. D., Malec, D. L., & Sivan, B. (2010). Multi-parameter mechanism design and sequential posted pricing. In Proceedings of the Forty-Second ACM Symposium on Theory of Computing (pp. 311\u2013320). Cambridge, Massachusetts, UK, June 6\u20138.","DOI":"10.1145\/1806689.1806733"},{"key":"9317_CR19","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., & Leighton, T. (2003). The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (p. 594). Cambridge, MA, October 11\u201314.","DOI":"10.1109\/SFCS.2003.1238232"},{"key":"9317_CR20","doi-asserted-by":"crossref","unstructured":"Mridha, S. K., & Bhattacharyya, M. (2018). Network based mechanisms for competitive crowdsourcing. In Proceedings of the ACM India joint international conference on data science and management of data (pp. 318\u2013321). ACM.","DOI":"10.1145\/3152494.3167979"},{"key":"9317_CR21","doi-asserted-by":"crossref","unstructured":"Heer, J., & Bostock, M. (2010). Crowdsourcing graphical perception: Using mechanical turk to assess visualization design. In Proceedings of the SIGCHI conference on human factors in computing systems (pp. 203\u2013212). ACM.","DOI":"10.1145\/1753326.1753357"},{"key":"9317_CR22","doi-asserted-by":"crossref","unstructured":"Chen, N., Gravin, N., & Lu, P. (2011). On the approximability of budget feasible mechanisms. In Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms (pp. 685\u2013699). San Francisco, California, USA, January 22.","DOI":"10.1137\/1.9781611973082.54"},{"key":"9317_CR23","doi-asserted-by":"crossref","unstructured":"Singer, Y. (2010). Budget feasible mechanisms. In Foundations of computer science (FOCS), 2010 51st annual IEEE symposium on (pp. 765\u2013774). IEEE.","DOI":"10.1109\/FOCS.2010.78"},{"key":"9317_CR24","doi-asserted-by":"crossref","unstructured":"Kulkarni, A. P., Can, M., & Hartmann, B. (2011). Turkomatic: Automatic recursive task and workflow design for mechanical turk. In CHI\u201911 extended abstracts on human factors in computing systems (pp. 2053\u20132058). ACM.","DOI":"10.1145\/1979742.1979865"},{"key":"9317_CR25","doi-asserted-by":"crossref","unstructured":"Kittur, A., Smus, B., Khamkar, S., & Kraut, R. E. (2011). Crowdforge: Crowdsourcing complex work. In Proceedings of the 24th annual ACM symposium on user interface software and technology (pp. 43\u201352). ACM.","DOI":"10.1145\/2047196.2047202"},{"key":"9317_CR26","doi-asserted-by":"crossref","unstructured":"Morris, M.R., Bigham, J. P., Brewer, R., Bragg, J., Kulkarni, A., Li, J., & Savage, S. (2017). Subcontracting microwork. In Proceedings of the 2017 CHI conference on human factors in computing systems (pp. 1867\u20131876). ACM.","DOI":"10.1145\/3025453.3025687"},{"issue":"3","key":"9317_CR27","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M. L., & Tarjan, R. E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3), 596\u2013615.","journal-title":"Journal of the ACM"}],"container-title":["Electronic Commerce Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10660-018-9317-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10660-018-9317-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10660-018-9317-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T07:44:52Z","timestamp":1693813492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10660-018-9317-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,9]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["9317"],"URL":"https:\/\/doi.org\/10.1007\/s10660-018-9317-8","relation":{},"ISSN":["1389-5753","1572-9362"],"issn-type":[{"value":"1389-5753","type":"print"},{"value":"1572-9362","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,9]]},"assertion":[{"value":"9 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}