{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T14:49:47Z","timestamp":1780843787621,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"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":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467571","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:45Z","timestamp":1626604125000},"page":"737-738","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization"],"prefix":"10.1145","author":[{"given":"Rad","family":"Niazadeh","sequence":"first","affiliation":[{"name":"The University of Chicago, Chicago, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Negin","family":"Golrezaei","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joshua R.","family":"Wang","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fransisca","family":"Susan","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashwinkumar","family":"Badanidiyuru","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Ranking an Assortment of Products Via Sequential Submodular Optimization. Available at SSRN 3542382","author":"Asadpour Arash","year":"2020","unstructured":"Arash Asadpour , Rad Niazadeh , Amin Saberi , and Ali Shameli . 2020. Ranking an Assortment of Products Via Sequential Submodular Optimization. Available at SSRN 3542382 ( 2020 ). Arash Asadpour, Rad Niazadeh, Amin Saberi, and Ali Shameli. 2020. Ranking an Assortment of Products Via Sequential Submodular Optimization. Available at SSRN 3542382 (2020)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1956.6.1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/130929205"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.55"},{"key":"e_1_3_2_1_5_1","volume-title":"Learning to Rank an Assortment of Products. Available at SSRN 3395992","author":"Ferreira Kris","year":"2019","unstructured":"Kris Ferreira , Sunanda Parthasarathy , and Shreyas Sekar . 2019. Learning to Rank an Assortment of Products. Available at SSRN 3395992 ( 2019 ). Kris Ferreira, Sunanda Parthasarathy, and Shreyas Sekar. 2019. Learning to Rank an Assortment of Products. Available at SSRN 3395992 (2019)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/070701704"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"e_1_3_2_1_8_1","volume-title":"An analysis of approximations for maximizing submodular set functions-I. Mathematical programming","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser , Laurence A Wolsey , and Marshall L Fisher . 1978. An analysis of approximations for maximizing submodular set functions-I. Mathematical programming , Vol. 14 , 1 ( 1978 ), 265--294. George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions-I. Mathematical programming, Vol. 14, 1 (1978), 265--294."},{"key":"e_1_3_2_1_9_1","unstructured":"Rad Niazadeh Tim Roughgarden and Joshua Wang. 2018. Optimal algorithms for continuous non-monotone submodular and dr-submodular maximization. In Advances in Neural Information Processing Systems. 9594--9604.  Rad Niazadeh Tim Roughgarden and Joshua Wang. 2018. Optimal algorithms for continuous non-monotone submodular and dr-submodular maximization. In Advances in Neural Information Processing Systems. 9594--9604."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355900"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","location":"Budapest Hungary","acronym":"EC '21","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467571","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:31Z","timestamp":1750191511000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":10,"alternative-id":["10.1145\/3465456.3467571","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467571","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}