{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:31Z","timestamp":1750306591956,"version":"3.41.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T00:00:00Z","timestamp":1422403200000},"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":[[2015,1,28]]},"abstract":"<jats:p>In this letter we briefly survey our main result from [Babaioff el al. 2014]: a simple and approximately revenue-optimal mechanism for a monopolist who wants to sell a variety of items to a single buyer with an additive valuation.<\/jats:p>","DOI":"10.1145\/2728732.2728736","type":"journal-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T14:05:51Z","timestamp":1422453951000},"page":"31-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A simple and approximately optimal mechanism for an additive buyer"],"prefix":"10.1145","volume":"13","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[{"name":"Microsoft Research"}]},{"given":"Nicole","family":"Immorlica","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]},{"given":"Brendan","family":"Lucier","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]},{"given":"S. Matthew","family":"Weinberg","sequence":"additional","affiliation":[{"name":"Princeton University"}]}],"member":"320","published-online":{"date-parts":[[2015,1,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.73"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Ausubel L. M. and Milgrom P. 2006. The lovely but lonely vickrey auction. In Combinatorial Auctions chapter 1. MIT Press.  Ausubel L. M. and Milgrom P. 2006. The lovely but lonely vickrey auction. In Combinatorial Auctions chapter 1. MIT Press.","DOI":"10.7551\/mitpress\/9780262033428.003.0002"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.11"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250946"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807366"},{"volume-title":"The Complexity of Optimal Mechanism Design. In the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Daskalakis C.","key":"e_1_2_1_7_1","unstructured":"Daskalakis , C. , Deckelbaum , A. , and Tzamos , C . 2014 . The Complexity of Optimal Mechanism Design. In the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Daskalakis, C., Deckelbaum, A., and Tzamos, C. 2014. The Complexity of Optimal Mechanism Design. In the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229061"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482544"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566407"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_2_1_13_1","first-page":"1","article-title":"A Property of Solutions to Linear Monopoly Problems","volume":"11","author":"Pavlov G.","year":"2011","unstructured":"Pavlov , G. 2011 . A Property of Solutions to Linear Monopoly Problems . B. E. Journal of Theoretical Economics 11 , 1 . Article 4. Pavlov, G. 2011. A Property of Solutions to Linear Monopoly Problems. B. E. Journal of Theoretical Economics 11, 1. Article 4.","journal-title":"Journal of Theoretical Economics"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602863"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2003.09.002"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722137"}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2728732.2728736","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2728732.2728736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:33Z","timestamp":1750227393000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2728732.2728736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,28]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,1,28]]}},"alternative-id":["10.1145\/2728732.2728736"],"URL":"https:\/\/doi.org\/10.1145\/2728732.2728736","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2015,1,28]]},"assertion":[{"value":"2015-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}