{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:23Z","timestamp":1750220363202,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"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"}],"funder":[{"name":"NSF CAREER Award","award":["CCF-1942497"],"award-info":[{"award-number":["CCF-1942497"]}]},{"name":"NSF Alan T. Waterman Award","award":["1933331"],"award-info":[{"award-number":["1933331"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467654","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:50Z","timestamp":1626604130000},"page":"204-223","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Prior-free Dynamic Mechanism Design With Limited Liability"],"prefix":"10.1145","author":[{"given":"Mark","family":"Braverman","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Schneider","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Matthew","family":"Weinberg","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219234"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940775"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/2696363"},{"volume-title":"the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS).","author":"Babaioff Moshe","key":"e_1_3_2_2_4_1","unstructured":"Moshe Babaioff , Nicole Immorlica , Brendan Lucier , and S. Matthew Weinberg . 2014. A Simple and Approximately Optimal Mechanism for an Additive Buyer . In the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS). Moshe Babaioff, Nicole Immorlica, Brendan Lucier, and S. Matthew Weinberg. 2014. A Simple and Approximately Optimal Mechanism for an Additive Buyer. In the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3084089"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6245(84)90006-4"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2015.05.009"},{"volume-title":"Dynamic Mechanism Design: An Introduction","author":"Bergemann Dirk","key":"e_1_3_2_2_8_1","unstructured":"Dirk Bergemann and Juuso Valimaki . 2018. Dynamic Mechanism Design: An Introduction . Cowles Foundation Discussion Papers 2102R. Cowles Foundation for Research in Economics, Yale University . Dirk Bergemann and Juuso Valimaki. 2018. Dynamic Mechanism Design: An Introduction. Cowles Foundation Discussion Papers 2102R. Cowles Foundation for Research in Economics, Yale University."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1765(85)90122-3"},{"key":"e_1_3_2_2_10_1","volume-title":"Multi-armed Bandit Problems with Strategic Arms. In Conference on Learning Theory. 383--416","author":"Braverman Mark","year":"2019","unstructured":"Mark Braverman , Jieming Mao , Jon Schneider , and S Matthew Weinberg . 2019 . Multi-armed Bandit Problems with Strategic Arms. In Conference on Learning Theory. 383--416 . Mark Braverman, Jieming Mao, Jon Schneider, and S Matthew Weinberg. 2019. Multi-armed Bandit Problems with Strategic Arms. In Conference on Learning Theory. 383--416."},{"volume-title":"Proceedings of the 48th ACM Conference on Theory of Computation(STOC).","author":"Cai Yang","key":"e_1_3_2_2_11_1","unstructured":"Yang Cai , Nikhil Devanur , and S. Matthew Weinberg . 2016. A Duality Based Unified Approach to Bayesian Mechanism Design . In Proceedings of the 48th ACM Conference on Theory of Computation(STOC). Yang Cai, Nikhil Devanur, and S. Matthew Weinberg. 2016. A Duality Based Unified Approach to Bayesian Mechanism Design. In Proceedings of the 48th ACM Conference on Theory of Computation(STOC)."},{"key":"e_1_3_2_2_12_1","volume-title":"Simple Mechanisms for Subadditive Buyers via Duality. Manuscript","author":"Cai Yang","year":"2016","unstructured":"Yang Cai and Mingfei Zhao . 2016. Simple Mechanisms for Subadditive Buyers via Duality. Manuscript ( 2016 ). Yang Cai and Mingfei Zhao. 2016. Simple Mechanisms for Subadditive Buyers via Duality. Manuscript (2016)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch101"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940756"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591855"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764491"},{"key":"e_1_3_2_2_17_1","volume-title":"2019 a. Robust pricing in non-clairvoyant dynamic mechanism design. Available at SSRN","author":"Deng Yuan","year":"2019","unstructured":"Yuan Deng , Sebastien Lahaie , and Vahab Mirrokni . 2019 a. Robust pricing in non-clairvoyant dynamic mechanism design. Available at SSRN ( 2019 ). Yuan Deng, Sebastien Lahaie, and Vahab Mirrokni. 2019 a. Robust pricing in non-clairvoyant dynamic mechanism design. Available at SSRN (2019)."},{"key":"e_1_3_2_2_18_1","unstructured":"Yuan Deng Jon Schneider and Balasubramanian Sivan. 2019 b. Prior-Free Dynamic Auctions with Low Regret Buyers. In Advances in Neural Information Processing Systems. 4804--4814.  Yuan Deng Jon Schneider and Balasubramanian Sivan. 2019 b. Prior-Free Dynamic Auctions with Low Regret Buyers. In Advances in Neural Information Processing Systems. 4804--4814."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.08.001"},{"key":"e_1_3_2_2_20_1","volume-title":"Simple versus optimal contracts. arXiv preprint arXiv:1808.03713","author":"D\u00fctting Paul","year":"2018","unstructured":"Paul D\u00fctting , Tim Roughgarden , and Inbal Talgam-Cohen . 2018. Simple versus optimal contracts. arXiv preprint arXiv:1808.03713 ( 2018 ). Paul D\u00fctting, Tim Roughgarden, and Inbal Talgam-Cohen. 2018. Simple versus optimal contracts. arXiv preprint arXiv:1808.03713 (2018)."},{"key":"e_1_3_2_2_21_1","volume-title":"Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19--21","author":"Fiat Amos","year":"2002","unstructured":"Amos Fiat , Andrew V. Goldberg , Jason D. Hartline , and Anna R. Karlin . 2002. Competitive generalized auctions . In Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19--21 , 2002 , Montr\u00e9 al, Qu\u00e9 bec, Canada, John H. Reif (Ed.). ACM, 72--81. https:\/\/doi.org\/10.1145\/509907.509921 Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, and Anna R. Karlin. 2002. Competitive generalized auctions. In Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19--21, 2002, Montr\u00e9 al, Qu\u00e9 bec, Canada, John H. Reif (Ed.). ACM, 72--81. https:\/\/doi.org\/10.1145\/509907.509921"},{"key":"e_1_3_2_2_22_1","volume-title":"Saks","author":"Goldberg Andrew V.","year":"2004","unstructured":"Andrew V. Goldberg , Jason D. Hartline , Anna R. Karlin , and Michael E . Saks . 2004 . A Lower Bound on the Competitive Ratio of Truthful Auctions. In STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25--27, 2004, Proceedings (Lecture Notes in Computer Science), Volker Diekert and Michel Habib (Eds.), Vol. 2996 . Springer , 644--655. https:\/\/doi.org\/10.1007\/978--3--540--24749--4_56 Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, and Michael E. Saks. 2004. A Lower Bound on the Competitive Ratio of Truthful Auctions. In STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25--27, 2004, Proceedings (Lecture Notes in Computer Science), Volker Diekert and Michel Habib (Eds.), Vol. 2996. Springer, 644--655. https:\/\/doi.org\/10.1007\/978--3--540--24749--4_56"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2006.02.003"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365768"},{"key":"e_1_3_2_2_25_1","volume-title":"October","volume":"122","author":"Hartline Jason D","year":"2013","unstructured":"Jason D Hartline . 2013 . Mechanism design and approximation. Book draft . October , Vol. 122 (2013). Jason D Hartline. 2013. Mechanism design and approximation. Book draft. October, Vol. 122 (2013)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1194"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175436"},{"key":"e_1_3_2_2_28_1","volume-title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016","author":"Mirrokni Vahab S.","year":"2016","unstructured":"Vahab S. Mirrokni , Renato Paes Leme , Pingzhong Tang , and Song Zuo . 2016 a. Dynamic Auctions with Bank Accounts . In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016 , New York, NY, USA, 9- -15 July 2016. 387--393. Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, and Song Zuo. 2016a. Dynamic Auctions with Bank Accounts. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9--15 July 2016. 387--393."},{"key":"e_1_3_2_2_29_1","volume-title":"Pingzhong Tang, and Song Zuo.","author":"Mirrokni Vahab S.","year":"2016","unstructured":"Vahab S. Mirrokni , Renato Paes Leme , Pingzhong Tang, and Song Zuo. 2016 b. Optimal dynamic mechanisms with ex-post IR via bank accounts. CoRR , Vol. abs\/ 1605 .08840 (2016). arxiv: 1605.08840 http:\/\/arxiv.org\/abs\/1605.08840 Vahab S. Mirrokni, Renato Paes Leme, Pingzhong Tang, and Song Zuo. 2016b. Optimal dynamic mechanisms with ex-post IR via bank accounts. CoRR, Vol. abs\/1605.08840 (2016). arxiv: 1605.08840 http:\/\/arxiv.org\/abs\/1605.08840"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219224"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884535"},{"key":"e_1_3_2_2_32_1","volume-title":"the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Chi-Chih Yao Andrew","year":"2015","unstructured":"Andrew Chi-Chih Yao . 2015 . An n-to-1 bidder reduction for multi-item auctions and its applications . In the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Andrew Chi-Chih Yao. 2015. An n-to-1 bidder reduction for multi-item auctions and its applications. In the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Budapest Hungary","acronym":"EC '21"},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467654","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":32,"alternative-id":["10.1145\/3465456.3467654","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467654","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"}}]}}