{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:22:28Z","timestamp":1783984948453,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","funder":[{"name":"ERC","award":["101077862"],"award-info":[{"award-number":["101077862"]}]},{"name":"ISF","award":["3331\/24"],"award-info":[{"award-number":["3331\/24"]}]},{"name":"Google Research Scholar Award"},{"name":"FAIR project","award":["PE0000013"],"award-info":[{"award-number":["PE0000013"]}]},{"name":"Horizon - ELIAS","award":["101120237"],"award-info":[{"award-number":["101120237"]}]},{"name":"JST ERATO","award":["JPMJER2301"],"award-info":[{"award-number":["JPMJER2301"]}]},{"name":"Harvard University CMSA"},{"name":"NUS Start-up Grant"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,7]]},"DOI":"10.1145\/3736252.3742600","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:48:05Z","timestamp":1751482085000},"page":"580-598","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-Project Contracts"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9982-1209","authenticated-orcid":false,"given":"Tal","family":"Alon","sequence":"first","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1070-6766","authenticated-orcid":false,"given":"Matteo","family":"Castiglioni","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0345-6460","authenticated-orcid":false,"given":"Junjie","family":"Chen","sequence":"additional","affiliation":[{"name":"Kyushu University, Fukuoka, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0626-4851","authenticated-orcid":false,"given":"Tomer","family":"Ezra","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8607-1453","authenticated-orcid":false,"given":"Yingkai","family":"Li","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2838-3264","authenticated-orcid":false,"given":"Inbal","family":"Talgam-Cohen","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597795"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the ACM Conference on Economics and Computation (EC). 52\u201369","author":"Alon Tal","year":"2021","unstructured":"Tal Alon, Paul D\u00fctting, and Inbal Talgam-Cohen. 2021. Contracts with Private Cost per Unit-of-Effort. In Proceedings of the ACM Conference on Economics and Computation (EC). 52\u201369."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2012.01.010"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of EC","author":"Babichenko Yakov","year":"2024","unstructured":"Yakov Babichenko, Inbal Talgam-Cohen, Haifeng Xu, and Konstantin Zabarnyi. 2024. Information Design in the Principal-Agent Problem. In Proc. of EC 2024."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 1758\u20131794","author":"Castiglioni Matteo","year":"2025","unstructured":"Matteo Castiglioni and Junjie Chen. 2025. Hiring for An Uncertain Task: Joint Design of Information and Contracts. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 1758\u20131794."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 1795\u20131836","author":"Castiglioni Matteo","year":"2025","unstructured":"Matteo Castiglioni, Junjie Chen, Minming Li, Haifeng Xu, and Song Zuo. 2025. A reduction from multi-parameter to single-parameter Bayesian contract design. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 1795\u20131836."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the ACM Conference on Economics and Computation (EC). 705\u2013735","author":"Castiglioni Matteo","year":"2022","unstructured":"Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti. 2022. Designing Menus of Contracts Efficiently: The Power of Randomization. In Proceedings of the ACM Conference on Economics and Computation (EC). 705\u2013735."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of EC","author":"Castiglioni Matteo","year":"2023","unstructured":"Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti. 2023. Multi-Agent Contract Design: How to Commission Multiple Agents with Individual Outcome. In Proc. of EC 2023. 412\u2013448."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 109\u2013132","author":"Deo-Campo Vuong Ramiro","year":"2024","unstructured":"Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, and Aditya Prasad. 2024. On supermodular contracts and dense subgraphs. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 109\u2013132."},{"key":"e_1_3_2_1_10_1","volume-title":"Combinatorial Contracts. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). 815\u2013826","author":"D\u00fctting Paul","year":"2021","unstructured":"Paul D\u00fctting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim. 2021a. Combinatorial Contracts. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). 815\u2013826."},{"key":"e_1_3_2_1_11_1","volume-title":"Multi-Agent Contracts. In Proceedings of the ACM Symposium on Theory of Computing (STOC). 1311\u20131324","author":"D\u00fctting Paul","year":"2023","unstructured":"Paul D\u00fctting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim. 2023. Multi-Agent Contracts. In Proceedings of the ACM Symposium on Theory of Computing (STOC). 1311\u20131324."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of SODA","author":"D\u00fctting Paul","year":"2025","unstructured":"Paul D\u00fctting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim. 2025. Multi-Agent Combinatorial Contracts. In Proc. of SODA 2025. Forthcoming."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 92\u2013108","author":"D\u00fctting Paul","year":"2024","unstructured":"Paul D\u00fctting, Michal Feldman, and Yoav Gal Tzur. 2024a. Combinatorial contracts beyond gross substitutes. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 92\u2013108."},{"key":"e_1_3_2_1_14_1","first-page":"3","article-title":"Algorithmic contract theory: A survey","volume":"16","author":"D\u00fctting Paul","year":"2024","unstructured":"Paul D\u00fctting, Michal Feldman, and Inbal Talgam-Cohen. 2024b. Algorithmic contract theory: A survey. Foundations and Trends in Theoretical Computer Science 16, 3\u20134 (2024), 211\u2013412.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the ACM Conference on Economics and Computation (EC). 369\u2013387","author":"D\u00fctting Paul","year":"2019","unstructured":"Paul D\u00fctting, Tim Roughgarden, and Inbal Talgam-Cohen. 2019. Simple versus optimal contracts. In Proceedings of the ACM Conference on Economics and Computation (EC). 369\u2013387."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M132153X"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. of ITCS","author":"Ezra Tomer","year":"2024","unstructured":"Tomer Ezra, Michal Feldman, and Maya Schlesinger. 2024. On the (in)approximability of Combinatorial Contracts. In Proc. of ITCS 2024. 44:1\u201344:22."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132523"},{"key":"e_1_3_2_1_19_1","unstructured":"Sebastian Fest Ola Kvaloy Petra Nieken and Anja Sch\u00f6ttner. 2020. Motivation and incentives in an online labor market. (2020)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","first-page":"105621","DOI":"10.1016\/j.jet.2023.105621","article-title":"Optimal technology design","volume":"209","author":"Garrett Daniel F","year":"2023","unstructured":"Daniel F Garrett, George Georgiadis, Alex Smolin, and Bal\u00e1zs Szentes. 2023. Optimal technology design. Journal of Economic Theory 209 (2023), 105621.","journal-title":"Journal of Economic Theory"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the ACM Conference on Economics and Computation (EC). 563\u2013582","author":"Guruganesh Guru","year":"2021","unstructured":"Guru Guruganesh, Jon Schneider, and Joshua Wang. 2021. Contracts under Moral Hazard and Adverse Selection. In Proceedings of the ACM Conference on Economics and Computation (EC). 563\u2013582."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597735"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3013558.3013568"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2022.4450"},{"key":"e_1_3_2_1_25_1","volume-title":"Moral Hazard and Performance Evaluation: Evidence from Online Labor Markets","author":"Wang Yifei","year":"2022","unstructured":"Yifei Wang and Peng Huang. 2022. Contract Choice, Moral Hazard and Performance Evaluation: Evidence from Online Labor Markets. In Academy of Management Proceedings, Vol. 2022. 14303."},{"key":"e_1_3_2_1_26_1","volume-title":"Yiming Liao, Yan Zhu, Qifan Wang, Hongning Wang, and Haifeng Xu.","author":"Yao Fan","year":"2024","unstructured":"Fan Yao, Chuanhao Li, Karthik Abinav Sankararaman, Yiming Liao, Yan Zhu, Qifan Wang, Hongning Wang, and Haifeng Xu. 2024. Rethinking incentives in recommender systems: Are monotone rewards always beneficial? Advances in Neural Information Processing Systems 36 (2024)."}],"event":{"name":"EC '25: 26th ACM Conference on Economics and Computation","location":"Stanford University Stanford CA USA","acronym":"EC '25","sponsor":["SIGecom ACM Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 26th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736252.3742600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:48:53Z","timestamp":1751482133000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":26,"alternative-id":["10.1145\/3736252.3742600","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742600","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2025-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}