{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:35:11Z","timestamp":1769974511950,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["249159"],"award-info":[{"award-number":["249159"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1435\/14"],"award-info":[{"award-number":["1435\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003973","name":"Israel Academy of Sciences and Humanities","doi-asserted-by":"publisher","award":["Adams Fellowship"],"award-info":[{"award-number":["Adams Fellowship"]}],"id":[{"id":"10.13039\/501100003973","id-type":"DOI","asserted-by":"publisher"}]},{"name":"United States-Israel Binational Science Foundation","award":["2014389"],"award-info":[{"award-number":["2014389"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055426","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"869-877","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["The menu-size complexity of revenue approximation"],"prefix":"10.1145","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[{"name":"Microsoft Research, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannai A.","family":"Gonczarowski","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Israel \/ Microsoft Research, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Israel \/ Microsoft Research, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.11"},{"key":"e_1_3_2_2_2_1","volume-title":"Proceedings of the Twenty-First Annual ACMSIAM Symposium on Discrete Algorithms (SODA). 585\u2013597","author":"Pricing","year":"2010","unstructured":"Pricing randomized allocations. In Proceedings of the Twenty-First Annual ACMSIAM Symposium on Discrete Algorithms (SODA). 585\u2013597 . Shuchi Chawla, David L. Malec, and Balasubramanian Sivan. 2010 . Pricing randomized allocations. In Proceedings of the Twenty-First Annual ACMSIAM Symposium on Discrete Algorithms (SODA). 585\u2013597. Shuchi Chawla, David L. Malec, and Balasubramanian Sivan. 2010."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE1517"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the National Academy of Sciences (PNAS) 110","author":"On","year":"2013","unstructured":"On revenue maximization for selling multiple independently distributed items . Proceedings of the National Academy of Sciences (PNAS) 110 , 28 ( 2013 ), 11232\u201311237. On revenue maximization for selling multiple independently distributed items. Proceedings of the National Academy of Sciences (PNAS) 110, 28 (2013), 11232\u201311237."},{"key":"e_1_3_2_2_5_1","volume-title":"Vincent","author":"Manelli Alejandro M.","year":"2006","unstructured":"Alejandro M. Manelli and Daniel R . Vincent . 2006 . Alejandro M. Manelli and Daniel R. Vincent. 2006."}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055426","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:27Z","timestamp":1750220607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":5,"alternative-id":["10.1145\/3055399.3055426","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055426","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}