{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:16:46Z","timestamp":1776885406338,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538270","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"705-735","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Designing Menus of Contracts Efficiently: The Power of Randomization"],"prefix":"10.1145","author":[{"given":"Matteo","family":"Castiglioni","sequence":"first","affiliation":[{"name":"Politecnico di Milano, Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchesi","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Gatti","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Derandomized graph products. computational complexity","author":"Alon Noga","year":"1995","unstructured":"Noga Alon , Uriel Feige , Avi Wigderson , and David Zuckerman . 1995. Derandomized graph products. computational complexity , Vol. 5 , 1 ( 1995 ), 60--75. https:\/\/doi.org\/10.1007\/BF01277956 10.1007\/BF01277956 Noga Alon, Uriel Feige, Avi Wigderson, and David Zuckerman. 1995. Derandomized graph products. computational complexity, Vol. 5, 1 (1995), 60--75. https:\/\/doi.org\/10.1007\/BF01277956"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467651"},{"key":"e_1_3_2_1_3_1","volume-title":"2021 b. Contracts with Private Cost per Unit-of-Effort. arXiv preprint arXiv:2111.09179","author":"Alon Tal","year":"2021","unstructured":"Tal Alon , Paul D\u00fctting , and Inbal Talgam-Cohen . 2021 b. Contracts with Private Cost per Unit-of-Effort. arXiv preprint arXiv:2111.09179 ( 2021 ). Tal Alon, Paul D\u00fctting, and Inbal Talgam-Cohen. 2021 b. Contracts with Private Cost per Unit-of-Effort. arXiv preprint arXiv:2111.09179 (2021)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134710"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_11"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1892211.1892220"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2012.01.010"},{"key":"e_1_3_2_1_8_1","first-page":"911","article-title":"Contract complexity","volume":"14","author":"Babaioff Moshe","year":"2014","unstructured":"Moshe Babaioff and Eyal Winter . 2014 . Contract complexity . EC , Vol. 14 (2014), 911 . Moshe Babaioff and Eyal Winter. 2014. Contract complexity. EC, Vol. 14 (2014), 911.","journal-title":"EC"},{"key":"e_1_3_2_1_9_1","volume-title":"Analysis of medicare pay-for-performance contracts. Available at SSRN 2839143","author":"Bastani Hamsa","year":"2016","unstructured":"Hamsa Bastani , Mohsen Bayati , Mark Braverman , Ramki Gummadi , and Ramesh Johari . 2016. Analysis of medicare pay-for-performance contracts. Available at SSRN 2839143 ( 2016 ). Hamsa Bastani, Mohsen Bayati, Mark Braverman, Ramki Gummadi, and Ramesh Johari. 2016. Analysis of medicare pay-for-performance contracts. Available at SSRN 2839143 (2016)."},{"key":"e_1_3_2_1_10_1","volume-title":"Introduction to linear optimization","author":"Bertsimas Dimitris","unstructured":"Dimitris Bertsimas and John N Tsitsiklis . 1997. Introduction to linear optimization . Vol. 6 . Athena Scientific Belmont , MA. Dimitris Bertsimas and John N Tsitsiklis. 1997. Introduction to linear optimization. Vol. 6. Athena Scientific Belmont, MA."},{"key":"e_1_3_2_1_11_1","unstructured":"Patrick Bolton Mathias Dewatripont etal 2005. Contract theory. MIT press.  Patrick Bolton Mathias Dewatripont et al. 2005. Contract theory. MIT press."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20131159"},{"key":"e_1_3_2_1_13_1","volume-title":"Bayesian Agency: Linear versus Tractable Contracts. arxiv: 2106.00319 [cs.GT]","author":"Castiglioni Matteo","year":"2021","unstructured":"Matteo Castiglioni , Alberto Marchesi , and Nicola Gatti . 2021 . Bayesian Agency: Linear versus Tractable Contracts. arxiv: 2106.00319 [cs.GT] Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti. 2021. Bayesian Agency: Linear versus Tractable Contracts. arxiv: 2106.00319 [cs.GT]"},{"key":"e_1_3_2_1_14_1","volume-title":"Bayesian Persuasion Meets Mechanism Design: Going Beyond Intractability with Type Reporting. arXiv preprint arXiv:2202.00605","author":"Castiglioni Matteo","year":"2022","unstructured":"Matteo Castiglioni , Alberto Marchesi , and Nicola Gatti . 2022. Bayesian Persuasion Meets Mechanism Design: Going Beyond Intractability with Type Reporting. arXiv preprint arXiv:2202.00605 ( 2022 ). Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti. 2022. Bayesian Persuasion Meets Mechanism Design: Going Beyond Intractability with Type Reporting. arXiv preprint arXiv:2202.00605 (2022)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/rfs\/hhz007"},{"key":"e_1_3_2_1_16_1","volume-title":"arXiv preprint arXiv:2109.14260","author":"Duetting Paul","year":"2021","unstructured":"Paul Duetting , Tomer Ezra , Michal Feldman , and Thomas Kesselheim . 2021. Combinatorial Contracts . arXiv preprint arXiv:2109.14260 ( 2021 ). Paul Duetting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim. 2021. Combinatorial Contracts. arXiv preprint arXiv:2109.14260 (2021)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.164"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329591"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.2307\/1912246"},{"key":"e_1_3_2_1_20_1","volume-title":"Wang","author":"Guruganesh Guru","year":"2021","unstructured":"Guru Guruganesh , Jon Schneider , and Joshua R . Wang . 2021 . Contracts under Moral Hazard and Adverse Selection .Association for Computing Machinery, New York, NY, USA , 563--582. https:\/\/doi.org\/10.1145\/3465456.3467637 10.1145\/3465456.3467637 Guru Guruganesh, Jon Schneider, and Joshua R. Wang. 2021. Contracts under Moral Hazard and Adverse Selection .Association for Computing Machinery, New York, NY, USA, 563--582. https:\/\/doi.org\/10.1145\/3465456.3467637"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3013558.3013568"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/jleo\/7.special_issue.24"},{"key":"e_1_3_2_1_23_1","volume-title":"The theory of incentives: the principal-agent model","author":"Laffont Jean-Jacques","unstructured":"Jean-Jacques Laffont and David Martimort . 2009. The theory of incentives: the principal-agent model . Princeton university press . Jean-Jacques Laffont and David Martimort. 2009. The theory of incentives: the principal-agent model. Princeton university press."},{"key":"e_1_3_2_1_24_1","volume-title":"Jerry R Green, et al.","author":"Mas-Colell Andreu","year":"1995","unstructured":"Andreu Mas-Colell , Michael Dennis Whinston , Jerry R Green, et al. 1995 . Microeconomic theory. Vol. 1 . Oxford university press New York . Andreu Mas-Colell, Michael Dennis Whinston, Jerry R Green, et al. 1995. Microeconomic theory. Vol. 1. Oxford university press New York."},{"key":"e_1_3_2_1_25_1","volume-title":"Repeated moral hazard. Econometrica: Journal of the Econometric Society","author":"Rogerson William P","year":"1985","unstructured":"William P Rogerson . 1985. Repeated moral hazard. Econometrica: Journal of the Econometric Society ( 1985 ), 69--76. William P Rogerson. 1985. Repeated moral hazard. Econometrica: Journal of the Econometric Society (1985), 69--76."},{"key":"e_1_3_2_1_26_1","volume-title":"Risk sharing and incentives in the principal and agent relationship. The Bell Journal of Economics","author":"Shavell Steven","year":"1979","unstructured":"Steven Shavell . 1979. Risk sharing and incentives in the principal and agent relationship. The Bell Journal of Economics ( 1979 ), 55--73. Steven Shavell. 1979. Risk sharing and incentives in the principal and agent relationship. The Bell Journal of Economics (1979), 55--73."},{"key":"e_1_3_2_1_27_1","volume-title":"Multiagent systems: Algorithmic, game-theoretic, and logical foundations","author":"Shoham Yoav","unstructured":"Yoav Shoham and Kevin Leyton-Brown . 2008. Multiagent systems: Algorithmic, game-theoretic, and logical foundations . Cambridge University Press . Yoav Shoham and Kevin Leyton-Brown. 2008. Multiagent systems: Algorithmic, game-theoretic, and logical foundations. Cambridge University Press."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380839"},{"key":"e_1_3_2_1_29_1","volume-title":"Recovering optimal basic variables in Karmarkar's polynomial algorithm for linear programming. Mathematics of operations research","author":"Yinyu Ye.","year":"1990","unstructured":"Yinyu Ye. 1990. Recovering optimal basic variables in Karmarkar's polynomial algorithm for linear programming. Mathematics of operations research , Vol. 15 , 3 ( 1990 ), 564--572. Yinyu Ye. 1990. Recovering optimal basic variables in Karmarkar's polynomial algorithm for linear programming. Mathematics of operations research, Vol. 15, 3 (1990), 564--572."}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","location":"Boulder CO USA","acronym":"EC '22","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538270","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:04Z","timestamp":1750188664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":29,"alternative-id":["10.1145\/3490486.3538270","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538270","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}