{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:56:26Z","timestamp":1743033386008,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031212024"},{"type":"electronic","value":"9783031212031"}],"license":[{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-21203-1_7","type":"book-chapter","created":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T07:35:25Z","timestamp":1668152125000},"page":"106-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Task Allocation on\u00a0Networks with\u00a0Execution Uncertainty"],"prefix":"10.1007","author":[{"given":"Xiuzhen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Dengji","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,12]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.geb.2015.09.001","volume":"113","author":"S Chawla","year":"2019","unstructured":"Chawla, S., Hartline, J.D., Sivan, B.: Optimal crowdsourcing contests. Games Econ. Behav. 113, 80\u201396 (2019)","journal-title":"Games Econ. Behav."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Vidali, A.: Mechanism design for scheduling with uncertain execution time. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2014, pp. 623\u2013629. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.8793"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/TSMCA.2007.893474","volume":"37","author":"RK Dash","year":"2007","unstructured":"Dash, R.K., Vytelingum, P., Rogers, A., David, E., Jennings, N.R.: Market-based task allocation mechanisms for limited-capacity suppliers. IEEE Trans. Syst. Man Cybern.-Part A: Syst. Hum. 37(3), 391\u2013405 (2007)","journal-title":"IEEE Trans. Syst. Man Cybern.-Part A: Syst. Hum."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Goel, G., Nikzad, A., Singla, A.: Allocating tasks to workers with matching constraints: truthful mechanisms for crowdsourcing markets. In: Proceedings of the 23rd International Conference on World Wide Web, pp. 279\u2013280 (2014)","DOI":"10.1145\/2567948.2577311"},{"issue":"8","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1109\/TPDS.2012.249","volume":"24","author":"Y Jiang","year":"2012","unstructured":"Jiang, Y., Zhou, Y., Wang, W.: Task allocation for undependable multiagent systems in social networks. IEEE Trans. Parallel Distrib. Syst. 24(8), 1671\u20131681 (2012)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103631","volume":"303","author":"B Li","year":"2022","unstructured":"Li, B., Hao, D., Gao, H., Zhao, D.: Diffusion auction design. Artif. Intell. 303, 103631 (2022)","journal-title":"Artif. Intell."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Li, B., Hao, D., Zhao, D.: Incentive-compatible diffusion auctions. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 231\u2013237. ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/33"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Li, B., Hao, D., Zhao, D., Zhou, T.: Mechanism design in social networks. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, pp. 586\u2013592. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10605"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.dss.2012.02.012","volume":"54","author":"YM Li","year":"2012","unstructured":"Li, Y.M., Shiu, Y.L.: A diffusion mechanism for social advertising over microblogs. Decis. Supp. Syst. 54(1), 9\u201322 (2012)","journal-title":"Decis. Supp. Syst."},{"issue":"1\u20132","key":"7_CR10","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35(1\u20132), 166\u2013196 (2001)","journal-title":"Games Econ. Behav."},{"issue":"15","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1016\/j.artint.2008.06.004","volume":"172","author":"R Porter","year":"2008","unstructured":"Porter, R., Ronen, A., Shoham, Y., Tennenholtz, M.: Fault tolerant mechanism design. Artif. Intell. 172(15), 1783\u20131799 (2008)","journal-title":"Artif. Intell."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1613\/jair.2751","volume":"35","author":"SD Ramchurn","year":"2009","unstructured":"Ramchurn, S.D., Mezzetti, C., Giovannucci, A., Rodriguez-Aguilar, J.A., Dash, R.K., Jennings, N.R.: Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty. J. Artif. Intell. Res. 35, 119\u2013159 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR13","unstructured":"Shi, H., Zhang, Y., Si, Z., Wang, L., Zhao, D.: Maximal information propagation with budgets. In: ECAI 2020\u201324th European Conference on Artificial Intelligence, vol. 325, pp. 211\u2013218. IOS Press (2020)"},{"issue":"4","key":"7_CR14","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.: Reflecting on the darpa red balloon challenge. Commun. ACM 54(4), 78\u201385 (2011)","journal-title":"Commun. ACM"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/s10458-011-9168-3","volume":"25","author":"MM de Weerdt","year":"2012","unstructured":"de Weerdt, M.M., Zhang, Y., Klos, T.: Multiagent task allocation in social networks. Auton. Agents Multi-Agent Syst. 25(1), 46\u201386 (2012)","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-63315-2_14","volume-title":"Intelligent Computing Methodologies","author":"X Wu","year":"2017","unstructured":"Wu, X., Huang, D., Sun, Y.-E., Bu, X., Xin, Yu., Huang, H.: An efficient allocation mechanism for crowdsourcing tasks with minimum execution time. In: Huang, D.-S., Hussain, A., Han, K., Gromiha, M.M. (eds.) ICIC 2017. LNCS (LNAI), vol. 10363, pp. 156\u2013167. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63315-2_14"},{"key":"7_CR17","unstructured":"Zhao, D.: Mechanism design powered by social interactions. In: Proceedings of the 20th International Conference on Autonomous Agents and Multi-Agent Systems, pp. 63\u201367 (2021)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Zhao, D.: Mechanism design powered by social interactions: a call to arms. In: Raedt, L.D. (ed.) Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22, pp. 5831\u20135835. International Joint Conferences on Artificial Intelligence Organization (2022), early Career","DOI":"10.24963\/ijcai.2022\/820"},{"key":"7_CR19","unstructured":"Zhao, D., Ramchurn, S.D., Jennings, N.R.: Fault tolerant mechanism design for general task allocation. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 323\u2013331. ACM (2016)"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2022: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21203-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T07:36:38Z","timestamp":1668152198000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21203-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,12]]},"ISBN":["9783031212024","9783031212031"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21203-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022,11,12]]},"assertion":[{"value":"12 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valencia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/prima2022.webs.upv.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 (demo paper)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}