{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:24:34Z","timestamp":1767338674316,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597735","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"818-848","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["The Power of Menus in Contract Design"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0963-3843","authenticated-orcid":false,"given":"Guru","family":"Guruganesh","sequence":"first","affiliation":[{"name":"Google Research, Mountain View, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5392-3560","authenticated-orcid":false,"given":"Jon","family":"Schneider","sequence":"additional","affiliation":[{"name":"Google, New York, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0770-0621","authenticated-orcid":false,"given":"Joshua","family":"Wang","sequence":"additional","affiliation":[{"name":"Google, Mountain View, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8228-7331","authenticated-orcid":false,"given":"Junyao","family":"Zhao","sequence":"additional","affiliation":[{"name":"Stanford, Palo Alto, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467651"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873650"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467602"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538270"},{"key":"e_1_3_2_1_5_1","volume-title":"Learning Approximately Optimal Contracts. In Algorithmic Game Theory: 15th International Symposium, SAGT 2022, Colchester, UK, September 12--15, 2022, Proceedings. Springer, 331--346","author":"Cohen Alon","year":"2022","unstructured":"Alon Cohen , Argyrios Deligkas , and Moran Koren . 2022 . Learning Approximately Optimal Contracts. In Algorithmic Game Theory: 15th International Symposium, SAGT 2022, Colchester, UK, September 12--15, 2022, Proceedings. Springer, 331--346 . Alon Cohen, Argyrios Deligkas, and Moran Koren. 2022. Learning Approximately Optimal Contracts. In Algorithmic Game Theory: 15th International Symposium, SAGT 2022, Colchester, UK, September 12--15, 2022, Proceedings. Springer, 331--346."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Paul D\u00fctting Tomer Ezra Michal Feldman and Thomas Kesselheim. 2021. Combinatorial Contracts. In FOCS. 815--826.  Paul D\u00fctting Tomer Ezra Michal Feldman and Thomas Kesselheim. 2021. Combinatorial Contracts. In FOCS. 815--826.","DOI":"10.1109\/FOCS52979.2021.00084"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329591"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Paul D\u00fctting Tim Roughgarden and Inbal Talgam-Cohen. 2020. The Complexity of Contracts. In SODA. 2688--2707.  Paul D\u00fctting Tim Roughgarden and Inbal Talgam-Cohen. 2020. The Complexity of Contracts. In SODA. 2688--2707.","DOI":"10.1137\/1.9781611975994.164"},{"key":"e_1_3_2_1_9_1","volume-title":"Optimal Coordination in Generalized Principal-Agent Problems: A Revisit and Extensions. arXiv preprint arXiv:2209.01146","author":"Gan Jiarui","year":"2022","unstructured":"Jiarui Gan , Minbiao Han , Jibang Wu , and Haifeng Xu. 2022. Optimal Coordination in Generalized Principal-Agent Problems: A Revisit and Extensions. arXiv preprint arXiv:2209.01146 ( 2022 ). Jiarui Gan, Minbiao Han, Jibang Wu, and Haifeng Xu. 2022. Optimal Coordination in Generalized Principal-Agent Problems: A Revisit and Extensions. arXiv preprint arXiv:2209.01146 (2022)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.2307\/1912246"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467637"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/3003320"}],"event":{"name":"EC '23: 24th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"London United Kingdom","acronym":"EC '23"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597735","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:56Z","timestamp":1750182536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":12,"alternative-id":["10.1145\/3580507.3597735","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597735","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}