{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T18:32:12Z","timestamp":1772649132082,"version":"3.50.1"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T00:00:00Z","timestamp":1606867200000},"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":["SIGecom Exch."],"published-print":{"date-parts":[[2020,12,2]]},"abstract":"<jats:p>\n            We survey the main results from [D\u00fctting, Kesselheim, and Lucier 2020]:\n            <jats:sup>1<\/jats:sup>\n            a simple posted-price mechanism for subadditive combinatorial auctions with\n            <jats:italic>m<\/jats:italic>\n            items that achieves an\n            <jats:italic>O<\/jats:italic>\n            (log log\n            <jats:italic>m<\/jats:italic>\n            ) approximation to the optimal welfare, plus a variant with entry fees that approximates revenue. These are based on a novel subadditive prophet inequality.\n          <\/jats:p>","DOI":"10.1145\/3440968.3440972","type":"journal-article","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T23:57:59Z","timestamp":1606953479000},"page":"32-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["An O(log log m) prophet inequality for subadditive combinatorial auctions"],"prefix":"10.1145","volume":"18","author":[{"given":"Paul","family":"D\u00fctting","sequence":"first","affiliation":[{"name":"Google Research and London School of Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Kesselheim","sequence":"additional","affiliation":[{"name":"University of Bonn"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Lucier","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,12,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897645"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055465"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310554"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323850"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"D\u00fctting P. and Kleinberg R. 2015. Polymatroid prophet inequalities. In ESA. 437--449.  D\u00fctting P. and Kleinberg R. 2015. Polymatroid prophet inequalities. In ESA. 437--449.","DOI":"10.1007\/978-3-662-48350-3_37"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680977"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488634"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722139"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884507"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_2_1_13_1","first-page":"197","article-title":"On semiamarts, amarts, and processes with finite value","volume":"4","author":"Krengel U.","year":"1978","journal-title":"Adv. in Prob. and Relat. Top."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039796"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3440968.3440972","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3440968.3440972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:51Z","timestamp":1750197771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3440968.3440972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,12,2]]}},"alternative-id":["10.1145\/3440968.3440972"],"URL":"https:\/\/doi.org\/10.1145\/3440968.3440972","relation":{},"ISSN":["1551-9031"],"issn-type":[{"value":"1551-9031","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,2]]},"assertion":[{"value":"2020-12-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}