{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:28:02Z","timestamp":1770280082868,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3520065","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"722-735","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Pricing ordered items"],"prefix":"10.1145","author":[{"given":"Shuchi","family":"Chawla","sequence":"first","affiliation":[{"name":"University of Texas at Austin, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rojin","family":"Rezvan","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifeng","family":"Teng","sequence":"additional","affiliation":[{"name":"Google Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.11"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134711"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Patrick Briest. 2008. Uniform budgets and the envy-free pricing problem. In International Colloquium on Automata Languages and Programming. 808\u2013819.  Patrick Briest. 2008. Uniform budgets and the envy-free pricing problem. In International Colloquium on Automata Languages and Programming. 808\u2013819.","DOI":"10.1007\/978-3-540-70575-8_66"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2014.04.011"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109678"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.76"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055465"},{"key":"e_1_3_2_1_8_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Chalermsook Parinya","unstructured":"Parinya Chalermsook , Julia Chuzhoy , Sampath Kannan , and Sanjeev Khanna . 2012. Improved hardness results for profit maximization pricing problems with unlimited supply . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques . Springer , 73\u201384. Parinya Chalermsook, Julia Chuzhoy, Sampath Kannan, and Sanjeev Khanna. 2012. Improved hardness results for profit maximization pricing problems with unlimited supply. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, 73\u201384."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.112"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.47"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250946"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.08.010"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940756"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329583"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399453"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.93"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.97"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399454"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085132"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00037"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_25"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940752"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Iftah Gamzu and Danny Segev. 2010. A sublogarithmic approximation for highway and tollbooth pricing. In International Colloquium on Automata Languages and Programming. 582\u2013593.  Iftah Gamzu and Danny Segev. 2010. A sublogarithmic approximation for highway and tollbooth pricing. In International Colloquium on Automata Languages and Programming. 582\u2013593.","DOI":"10.1007\/978-3-642-14165-2_49"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3439722"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/140998846"},{"key":"e_1_3_2_1_27_1","first-page":"1164","article-title":"On profit-maximizing envy-free pricing","volume":"5","author":"Guruswami Venkatesan","year":"2005","unstructured":"Venkatesan Guruswami , Jason D Hartline , Anna R Karlin , David Kempe , Claire Kenyon , and Frank McSherry . 2005 . On profit-maximizing envy-free pricing .. In SODA. 5 , 1164 \u2013 1173 . Venkatesan Guruswami, Jason D Hartline, Anna R Karlin, David Kempe, Claire Kenyon, and Frank McSherry. 2005. On profit-maximizing envy-free pricing.. In SODA. 5, 1164\u20131173.","journal-title":"SODA."},{"key":"e_1_3_2_1_28_1","volume-title":"The menu-size complexity of auctions","author":"Hart Sergiu","unstructured":"Sergiu Hart and Noam Nisan . 2013. The menu-size complexity of auctions . Center for the Study of Rationality. Sergiu Hart and Noam Nisan. 2013. The menu-size complexity of auctions. Center for the Study of Rationality."},{"key":"e_1_3_2_1_29_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Khandekar Rohit","unstructured":"Rohit Khandekar , Tracy Kimbrel , Konstantin Makarychev , and Maxim Sviridenko . 2009. On hardness of pricing items for single-minded bidders . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques . Springer , 202\u2013216. Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, and Maxim Sviridenko. 2009. On hardness of pricing items for single-minded bidders. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, 202\u2013216."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00023"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746549"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1309533110"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4068(85)90015-1"},{"key":"e_1_3_2_1_34_1","first-page":"3","article-title":"Simple mechanisms for a subadditive buyer and applications to revenue monotonicity","volume":"6","author":"Rubinstein Aviad","year":"2018","unstructured":"Aviad Rubinstein and S Matthew Weinberg . 2018 . Simple mechanisms for a subadditive buyer and applications to revenue monotonicity . ACM Transactions on Economics and Computation (TEAC) , 6 , 3 - 4 (2018), 1\u201325. Aviad Rubinstein and S Matthew Weinberg. 2018. Simple mechanisms for a subadditive buyer and applications to revenue monotonicity. ACM Transactions on Economics and Computation (TEAC), 6, 3-4 (2018), 1\u201325.","journal-title":"ACM Transactions on Economics and Computation (TEAC)"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.132"},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. 92\u2013109","author":"Chi-Chih Yao Andrew","year":"2014","unstructured":"Andrew Chi-Chih Yao . 2014 . An n-to-1 bidder reduction for multi-item auctions and its applications . In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. 92\u2013109 . Andrew Chi-Chih Yao. 2014. An n-to-1 bidder reduction for multi-item auctions and its applications. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. 92\u2013109."}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520065","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:15Z","timestamp":1750188675000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":36,"alternative-id":["10.1145\/3519935.3520065","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520065","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}