{"type":"ScholarlyArticle","title":"Task Allocation on Networks with Execution Uncertainty (Extended Abstract)∗","authors":[{"name":"Yao Zhang","slug":"yao-zhang","given":"Yao","family":"Zhang","affiliation":"Shanghai Engineering Research Center of Intelligent Vision and Imaging , ShanghaiTech University , Shanghai , China"},{"name":"Xiuzhen Zhang","slug":"xiuzhen-zhang","given":"Xiuzhen","family":"Zhang","affiliation":"Shanghai Engineering Research Center of Intelligent Vision and Imaging , ShanghaiTech University , Shanghai , China"},{"name":"Dengji Zhao","slug":"dengji-zhao","given":"Dengji","family":"Zhao","affiliation":"Shanghai Engineering Research Center of Intelligent Vision and Imaging , ShanghaiTech University , Shanghai , China"}],"abstract":"We study a single task allocation problem where each worker connects to some other workers to form a network and the task requester only connects to some of the workers. The goal is to design an allocation mechanism such that each worker is incentivized to invite her neighbours to join the allocation, although they are competing for the task. Moreover, the performance of each worker is uncertain, which is modelled as the quality level of her task execution. The literature has proposed solutions to tackle the uncertainty problem by paying them after verifying their execution. Here, we extend the problem to the network setting. We propose a new mechanism that guarantees that inviting more workers and reporting/performing according to her true ability is a dominant strategy for each worker. We believe that the new solution can be widely applied in the digital economy powered by social connections such as crowdsourcing.","doi":"10.24963/ijcai.2023/729","url":"https://ijcai.org/proceedings/2023/729","pdf":"https://ijcai.org/proceedings/2023/0729.pdf","markdown":"https://ijcai.org/proceedings/2023/729.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/729","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Sister Conferences Best Papers","track":"Sister Conferences Best Papers","number":729,"pages":{"first":6509,"last":6513},"keywords":["Sister Conferences Best Papers: Agent-based and Multi-agent Systems"],"videos":[],"references":[{"position":1,"raw":"[Chawla et al., 2019] Shuchi Chawla, Jason D Hartline, and Balasubramanian Sivan. Optimal crowdsourcing contests. Games and Economic Behavior, 113:80-96, 2019.","title":"Optimal crowdsourcing contests","authors":"Shuchi Chawla, Jason D Hartline, Balasubramanian Sivan","year":"2019","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Conitzer and Vidali, 2014] Vincent Conitzer and Angelina Vidali. Mechanism design for scheduling with uncer- tain execution time. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AAAI'14, page 623-629. AAAI Press, 2014.","title":"Mechanism design for scheduling with uncertain execution time","authors":"Vidali Conitzer, Vincent Conitzer, Angelina Vidali","year":"2014","venue":"Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AAAI'14","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Dash et al., 2007] Rajdeep K Dash, Perukrishnen Vytelingum, Alex Rogers, Esther David, and Nicholas R Jennings. Market-based task allocation mechanisms for limited-capacity suppliers. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 37(3):391-405, 2007.","title":"Market-based task allocation mechanisms for limited-capacity suppliers","authors":"Perukrishnen Rajdeep K Dash, Alex Vytelingum, Esther Rogers, Nicholas R David, Jennings","year":"2007","venue":"IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[de Weerdt et al., 2012] Mathijs M de Weerdt, Yingqian Zhang, and Tomas Klos. Multiagent task allocation in so- cial networks. Autonomous Agents and Multi-Agent Sys- tems, 25(1):46-86, 2012.","title":"Multiagent task allocation in social networks","authors":"Yingqian Mathijs M De Weerdt, Tomas Zhang, Klos","year":"2012","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Goel et al., 2014] Gagan Goel, Afshin Nikzad, and Adish Singla. Allocating tasks to workers with matching con- straints: truthful mechanisms for crowdsourcing markets. In Proceedings of the 23rd International Conference on World Wide Web, pages 279-280, 2014.","title":"Allocating tasks to workers with matching constraints: truthful mechanisms for crowdsourcing markets","authors":"Gagan Goel, Afshin Nikzad, Adish Singla","year":"2014","venue":"Proceedings of the 23rd International Conference on World Wide Web","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Jiang et al., 2012] Yichuan Jiang, Yifeng Zhou, and Wanyuan Wang. Task allocation for undependable multi- agent systems in social networks. IEEE Transactions on Parallel and Distributed Systems, 24(8):1671-1681, 2012.","title":"Task allocation for undependable multiagent systems in social networks","authors":"Yichuan Jiang, Yifeng Zhou, Wanyuan Wang","year":"2012","venue":"IEEE Transactions on Parallel and Distributed Systems","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Li and Shiu, 2012] Yung-Ming Li and Ya-Lin Shiu. A dif- fusion mechanism for social advertising over microblogs. Decision Support Systems, 54(1):9-22, 2012.","title":"A diffusion mechanism for social advertising over microblogs","authors":"Li, Shiu ; Yung-Ming Li, Ya-Lin Shiu","year":"2012","venue":"Decision Support Systems","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Li et al., 2017] Bin Li, Dong Hao, Dengji Zhao, and Tao Zhou. Mechanism design in social networks. In Proceed- ings of the Thirty-First AAAI Conference on Artificial In- telligence, pages 586-592. AAAI Press, 2017.","title":"Mechanism design in social networks","authors":"Bin Li, Dong Hao, Dengji Zhao, Tao Zhou","year":"2017","venue":"Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Li et al., 2020] Bin Li, Dong Hao, and Dengji Zhao. Incentive-compatible diffusion auctions. In Proceedings of the Twenty-Ninth International Joint Conference on Ar- tificial Intelligence, IJCAI 2020, pages 231-237. ijcai.org, 2020.","title":"Incentive-compatible diffusion auctions","authors":"Bin Li, Dong Hao, Dengji Zhao","year":"2020","venue":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020","doi":null,"url":null,"internal_url":"/proceedings/2020/33"},{"position":10,"raw":"[Li et al., 2022] Bin Li, Dong Hao, Hui Gao, and Dengji Zhao. Diffusion auction design. Artificial Intelligence, 303:103631, 2022.","title":"Diffusion auction design","authors":"Bin Li, Dong Hao, Hui Gao, Dengji Zhao","year":"2022","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Nisan and Ronen, 2001] Noam Nisan and Amir Ronen. Al- gorithmic mechanism design. Games and Economic be- havior, 35(1-2):166-196, 2001.","title":"Noam Nisan and Amir Ronen. Algorithmic mechanism design","authors":"Ronen Nisan","year":"2001","venue":"Games and Economic behavior","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Porter et al., 2008] Ryan Porter, Amir Ronen, Yoav Shoham, and Moshe Tennenholtz. Fault tolerant mecha- nism design. Artificial Intelligence, 172(15):1783-1799, 2008.","title":"Fault tolerant mechanism design","authors":"Ryan Porter, Yoav Amir Ronen, Moshe Shoham, Tennenholtz","year":"2008","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Ramchurn et al., 2009] Sarvapali D Ramchurn, Claudio Mezzetti, Andrea Giovannucci, Juan A Rodriguez- Aguilar, Rajdeep K Dash, and Nicholas R Jennings. Trust- based mechanisms for robust and efficient task allocation in the presence of execution uncertainty. Journal of Artifi- cial Intelligence Research, 35:119-159, 2009.","title":"Trustbased mechanisms for robust and efficient task allocation in the presence of execution uncertainty","authors":"Claudio Sarvapali D Ramchurn, Andrea Mezzetti, Juan A Giovannucci, Rajdeep K Rodriguez-Aguilar, Nicholas R Dash, Jennings","year":"2009","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Shi et al., 2020] Haomin Shi, Yao Zhang, Zilin Si, Letong Wang, and Dengji Zhao. Maximal information propaga- tion with budgets. In ECAI 2020 -24th European Con- ference on Artificial Intelligence, volume 325, pages 211- 218. IOS Press, 2020.","title":"Maximal information propagation with budgets","authors":"Haomin Shi, Yao Zhang, Zilin Si, Letong Wang, Dengji Zhao","year":"2020","venue":"ECAI 2020 -24th European Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Tang et al., 2011] John C Tang, Manuel Cebrian, Nick- laus A Giacobe, Hyun-Woo Kim, Taemie Kim, and Dou- glas\" Beaker\" Wickert. Reflecting on the darpa red bal- loon challenge. Communications of the ACM, 54(4):78- 85, 2011.","title":"Beaker\" Wickert. Reflecting on the darpa red balloon challenge","authors":"Manuel John C Tang, Cebrian, A Nicklaus, Hyun-Woo Giacobe, Taemie Kim, Douglas Kim","year":"2011","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Wu et al., 2017] Xiaocan Wu, Danlei Huang, Yu-E Sun, Xi- aofei Bu, Yu Xin, and He Huang. An efficient allocation mechanism for crowdsourcing tasks with minimum execu- tion time. In International Conference on Intelligent Com- puting, pages 156-167. Springer, 2017.","title":"An efficient allocation mechanism for crowdsourcing tasks with minimum execution time","authors":"Xiaocan Wu, Danlei Huang, Yu-E Sun, Xiaofei Bu, Yu Xin, He Huang","year":"2017","venue":"International Conference on Intelligent Computing","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Zhao et al., 2016] Dengji Zhao, Sarvapali D. Ramchurn, and Nicholas R. Jennings. Fault tolerant mechanism de- sign for general task allocation. In Proceedings of the 2016 International Conference on Autonomous Agents & Multi- agent Systems, pages 323-331. ACM, 2016.","title":"Fault tolerant mechanism design for general task allocation","authors":"Zhao","year":"2016","venue":"Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Zhao, 2021] Dengji Zhao. Mechanism design powered by social interactions. In Proceedings of the 20th Interna- tional Conference on Autonomous Agents and MultiAgent Systems, pages 63-67, 2021.","title":"Mechanism design powered by social interactions","authors":"Dengji Zhao, Zhao","year":"2021","venue":"Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Zhao, 2022] Dengji Zhao. Mechanism design powered by social interactions: a call to arms. In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22, pages 5831-5835, 2022.","title":"Mechanism design powered by social interactions: a call to arms","authors":"Dengji Zhao, Zhao","year":"2022","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22","doi":null,"url":null,"internal_url":"/proceedings/2022/820"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}