{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T06:17:23Z","timestamp":1725776243192},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["337122"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,11]]},"DOI":"10.1145\/3219166.3219202","type":"proceedings-article","created":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T12:42:08Z","timestamp":1537533728000},"page":"443-460","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["99% Revenue via Enhanced Competition"],"prefix":"10.1145","author":[{"given":"Michal","family":"Feldman","sequence":"first","affiliation":[{"name":"Tel-Aviv University and Microsoft Research, Tel-Aviv, Israel"}]},{"given":"Ophir","family":"Friedler","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}]},{"given":"Aviad","family":"Rubinstein","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.11"},{"volume-title":"Proceedings. 95--105","year":"2015","author":"Bateni MohammadHossein","key":"e_1_3_2_2_2_1","unstructured":"MohammadHossein Bateni , Sina Dehghani , MohammadTaghi Hajiaghayi , and Saeed Seddighin . 2015 . Revenue Maximization for Selling Multiple Correlated Items Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14--16, 2015 , Proceedings. 95--105 . MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, and Saeed Seddighin. 2015. Revenue Maximization for Selling Multiple Correlated Items Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14--16, 2015, Proceedings. 95--105."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873650"},{"volume-title":"Auctions Versus Negotiations. The American Economic Review","year":"1996","author":"Bulow Jeremy","key":"e_1_3_2_2_4_1","unstructured":"Jeremy Bulow and Paul Klemperer . 1996. Auctions Versus Negotiations. The American Economic Review ( 1996 ), 180--194. Jeremy Bulow and Paul Klemperer. 1996. Auctions Versus Negotiations. The American Economic Review (1996), 180--194."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133056"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897645"},{"volume-title":"Simple and Nearly Optimal Multi-Item Auctions. the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","year":"2013","author":"Cai Yang","key":"e_1_3_2_2_7_1","unstructured":"Yang Cai and Zhiyi Huang . 2013 . Simple and Nearly Optimal Multi-Item Auctions. the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Yang Cai and Zhiyi Huang. 2013. Simple and Nearly Optimal Multi-Item Auctions. the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055465"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250946"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.08.010"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940756"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.93"},{"volume-title":"The Complexity of Optimal Multidimensional Pricing Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014","year":"2014","author":"Chen Xi","key":"e_1_3_2_2_14_1","unstructured":"Xi Chen , Ilias Diakonikolas , Dimitris Paparas , Xiaorui Sun , and Mihalis Yannakakis . 2014 . The Complexity of Optimal Multidimensional Pricing Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014 , Portland, Oregon, USA, January 5--7 , 2014. 1319--1328. Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, and Mihalis Yannakakis. 2014. The Complexity of Optimal Multidimensional Pricing Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5--7, 2014. 1319--1328."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634170"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764539"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085115"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085116"},{"volume-title":"Designing and learning optimal finite support auctions Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms","author":"Elkind Edith","key":"e_1_3_2_2_19_1","unstructured":"Edith Elkind . 2007. Designing and learning optimal finite support auctions Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms . Society for Industrial and Applied Mathematics , 736--745. Edith Elkind. 2007. Designing and learning optimal finite support auctions Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 736--745."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54110-4_12"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229061"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482544"},{"volume-title":"Reny","year":"2012","author":"Hart Sergiu","key":"e_1_3_2_2_23_1","unstructured":"Sergiu Hart and Philip J . Reny . 2012 . Maximal Revenue with Multiple Goods : Nonmonotonicity and Other Observations. Discussion Paper Series dp630, The Center for the Study of Rationality, Hebrew University , Jerusalem (2012). Sergiu Hart and Philip J. Reny. 2012. Maximal Revenue with Multiple Goods: Nonmonotonicity and Other Observations. Discussion Paper Series dp630, The Center for the Study of Rationality, Hebrew University, Jerusalem (2012)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Jason D Hartline. 2013. Mechanism design and approximation. (2013). Jason D Hartline. 2013. Mechanism design and approximation. (2013).","DOI":"10.1561\/9781601986719"},{"volume-title":"How Many Ads Does Google Serve In A Day? Read more at https:\/\/www.business2community.com\/online-marketing\/how-many-ads-does-google-serve-in-a-day-0322253. Bussines2Community (Nov","year":"2012","author":"Kim Larry","key":"e_1_3_2_2_25_1","unstructured":"Larry Kim . 2012. How Many Ads Does Google Serve In A Day? Read more at https:\/\/www.business2community.com\/online-marketing\/how-many-ads-does-google-serve-in-a-day-0322253. Bussines2Community (Nov . 2012 ). https:\/\/www.business2community.com\/online-marketing\/how-many-ads-does-google-serve-in-a-day-0322253 Larry Kim. 2012. How Many Ads Does Google Serve In A Day? Read more at https:\/\/www.business2community.com\/online-marketing\/how-many-ads-does-google-serve-in-a-day-0322253. Bussines2Community (Nov. 2012). https:\/\/www.business2community.com\/online-marketing\/how-many-ads-does-google-serve-in-a-day-0322253"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Siqi Liu and Christos-Alexandros Psomas. 2018. On the Competition Complexity of Dynamic Mechanism Design SODA. To appear. Siqi Liu and Christos-Alexandros Psomas. 2018. On the Competition Complexity of Dynamic Mechanism Design SODA. To appear.","DOI":"10.1137\/1.9781611975031.131"},{"volume-title":"Reaping the Benefits of Bundling under High Production Costs. CoRR","year":"2015","author":"Ma Will","key":"e_1_3_2_2_29_1","unstructured":"Will Ma and David Simchi-Levi . 2015. Reaping the Benefits of Bundling under High Production Costs. CoRR Vol. abs\/ 1512 .02300 ( 2015 ). http:\/\/arxiv.org\/abs\/1512.02300 Will Ma and David Simchi-Levi. 2015. Reaping the Benefits of Bundling under High Production Costs. CoRR Vol. abs\/1512.02300 (2015). http:\/\/arxiv.org\/abs\/1512.02300"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.2307\/2999574"},{"volume-title":"Robust Auctions for Revenue via Enhanced Competition. (2015). Working paper","author":"Roughgarden Tim","key":"e_1_3_2_2_32_1","unstructured":"Tim Roughgarden , Inbal Talgam-Cohen , and Qiqi Yan . 2015. Robust Auctions for Revenue via Enhanced Competition. (2015). Working paper ; a preliminary version appeared in EC '12. Tim Roughgarden, Inbal Talgam-Cohen, and Qiqi Yan. 2015. Robust Auctions for Revenue via Enhanced Competition. (2015). Working paper; a preliminary version appeared in EC'12."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840736"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764510"},{"volume-title":"On Revenue Monotonicity in Combinatorial Auctions. CoRR","year":"2017","author":"Chi-Chih Yao Andrew","key":"e_1_3_2_2_35_1","unstructured":"Andrew Chi-Chih Yao . 2017. On Revenue Monotonicity in Combinatorial Auctions. CoRR Vol. abs\/ 1709 .03223 ( 2017 ). {arxiv}1709.03223 http:\/\/arxiv.org\/abs\/1709.03223 Andrew Chi-Chih Yao. 2017. On Revenue Monotonicity in Combinatorial Auctions. CoRR Vol. abs\/1709.03223 (2017). {arxiv}1709.03223 http:\/\/arxiv.org\/abs\/1709.03223"},{"volume-title":"An n-to-1 bidder reduction for multi-item auctions and its applications Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Chi-Chih Yao Andrew","key":"e_1_3_2_2_36_1","unstructured":"Andrew Chi-Chih Yao . 2015. An n-to-1 bidder reduction for multi-item auctions and its applications Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms . SIAM , 92--109. Andrew Chi-Chih Yao. 2015. An n-to-1 bidder reduction for multi-item auctions and its applications Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 92--109."}],"event":{"name":"EC '18: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Ithaca NY USA","acronym":"EC '18"},"container-title":["Proceedings of the 2018 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219166.3219202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T01:09:39Z","timestamp":1673226579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219166.3219202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":36,"alternative-id":["10.1145\/3219166.3219202","10.1145\/3219166"],"URL":"http:\/\/dx.doi.org\/10.1145\/3219166.3219202","relation":{},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}