{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:30Z","timestamp":1750309350090,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF award","award":["CCF-2327010"],"award-info":[{"award-number":["CCF-2327010"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673495","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"922-939","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Bandit Sequential Posted Pricing via Half-Concavity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8800-6479","authenticated-orcid":false,"given":"Sahil","family":"Singla","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5117-5706","authenticated-orcid":false,"given":"Yifan","family":"Wang","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164539"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.08.002"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451036"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219217"},{"key":"e_1_3_2_1_5_1","first-page":"1386790","article-title":"Posted prices vs. negotiations: an asymptotic analysis","volume":"10","author":"Blumrosen Liad","year":"2008","unstructured":"Liad Blumrosen and Thomas Holenstein. 2008. Posted prices vs. negotiations: an asymptotic analysis. EC 10 (2008), 1386790--1386801.","journal-title":"EC"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.54"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520029"},{"key":"e_1_3_2_1_9_1","unstructured":"Nicolo Cesa-Bianchi Tommaso Cesari and Vianney Perchet. 2019. Dynamic pricing with finitely many unknown valuations. In Algorithmic Learning Theory. PMLR 247--273."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2365772"},{"volume-title":"Prediction, learning, and games","author":"Cesa-Bianchi Nicolo","key":"e_1_3_2_1_11_1","unstructured":"Nicolo Cesa-Bianchi and G\u00e1bor Lugosi. 2006. Prediction, learning, and games. Cambridge university press."},{"volume-title":"the 8th ACM Conference on Electronic Commerce (EC).","author":"Chawla Shuchi","key":"e_1_3_2_1_12_1","unstructured":"Shuchi Chawla, Jason D. Hartline, and Robert D. Kleinberg. 2007. Algorithmic Pricing via Virtual Valuations. In the 8th ACM Conference on Electronic Commerce (EC)."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC. 311--320","author":"Chawla Shuchi","year":"2010","unstructured":"Shuchi Chawla, Jason D. Hartline, David L. Malec, and Balasubramanian Sivan. 2010. Multi-parameter mechanism design and sequential posted pricing. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC. 311--320."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.08.010"},{"key":"e_1_3_2_1_15_1","volume-title":"On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS. 1464--1479","author":"Chen Xi","year":"2015","unstructured":"Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, and Mihalis Yannakakis. 2015. On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS. 1464--1479."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591867"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 31th International Conference on Machine Learning, ICML (JMLR Workshop and Conference Proceedings","volume":"529","author":"Combes Richard","year":"2014","unstructured":"Richard Combes and Alexandre Prouti\u00e8re. 2014. Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms. In Proceedings of the 31th International Conference on Machine Learning, ICML (JMLR Workshop and Conference Proceedings, Vol. 32). JMLR.org, 521--529."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2018.11.010"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897553"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2014.03.011"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1086\/695529"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.18"},{"volume-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC. ACM, 856--868","author":"Yannai","key":"e_1_3_2_1_23_1","unstructured":"Yannai A. Gonczarowski and Noam Nisan. 2017. Efficient empirical revenue maximization in single-parameter auction environments. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC. ACM, 856--868."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3439722"},{"key":"e_1_3_2_1_25_1","volume-title":"Conference on Learning Theory, COLT. 2248--2288","author":"Guo Chenghao","year":"2021","unstructured":"Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, and Xinzhi Zhang. 2021. Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem. In Conference on Learning Theory, COLT. 2248--2288."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316325"},{"key":"e_1_3_2_1_27_1","volume-title":"Mechanism design and approximation. Book draft. October 122, 1","author":"Hartline Jason D","year":"2013","unstructured":"Jason D Hartline. 2013. Mechanism design and approximation. Book draft. October 122, 1 (2013)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1065719"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3557045"},{"key":"e_1_3_2_1_30_1","volume-title":"Learning Reserve Prices in Second-Price Auctions. In 14th Innovations in Theoretical Computer Science Conference, ITCS.","author":"Jin Yaonan","year":"2023","unstructured":"Yaonan Jin, Pinyan Lu, and Tao Xiao. 2023. Learning Reserve Prices in Second-Price Auctions. In 14th Innovations in Theoretical Computer Science Conference, ITCS."},{"volume-title":"44th Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, 594--605","author":"Robert","key":"e_1_3_2_1_31_1","unstructured":"Robert D. Kleinberg and Frank Thomson Leighton. 2003. The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions. In 44th Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, 594--605."},{"volume-title":"Bandit algorithms","author":"Lattimore Tor","key":"e_1_3_2_1_32_1","unstructured":"Tor Lattimore and Csaba Szepesv\u00e1ri. 2020. Bandit algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597686"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch17"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3144722.3144725"},{"key":"e_1_3_2_1_36_1","volume-title":"Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms. CoRR abs\/1405.4758","author":"Magureanu Stefan","year":"2014","unstructured":"Stefan Magureanu, Richard Combes, and Alexandre Prouti\u00e8re. 2014. Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms. CoRR abs\/1405.4758 (2014). arXiv:1405.4758 http:\/\/arxiv.org\/abs\/1405.4758"},{"key":"e_1_3_2_1_37_1","volume-title":"Algorithmic Learning Theory","volume":"132","author":"Meister Michela","year":"2021","unstructured":"Michela Meister and Sloan Nietert. 2021. Learning with Comparison Feedback: Online Estimation of Sample Statistics. In Algorithmic Learning Theory, Vol. 132. PMLR, 983--1001."},{"key":"e_1_3_2_1_38_1","volume-title":"Proceedings of the 29th Conference on Learning Theory, COLT (JMLR Workshop and Conference Proceedings","volume":"1318","author":"Morgenstern Jamie","year":"2016","unstructured":"Jamie Morgenstern and Tim Roughgarden. 2016. Learning Simple Auctions. In Proceedings of the 29th Conference on Learning Theory, COLT (JMLR Workshop and Conference Proceedings, Vol. 49). JMLR.org, 1298--1318."},{"key":"e_1_3_2_1_39_1","volume-title":"Optimal auction design. Mathematics of operations research 6, 1","author":"Myerson Roger B","year":"1981","unstructured":"Roger B Myerson. 1981. Optimal auction design. Mathematics of operations research 6, 1 (1981), 58--73."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467571"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch135"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Tim Roughgarden. 2017. Twenty lectures on algorithmic game theory.","DOI":"10.1017\/CBO9781316779309"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940723"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.56"}],"event":{"name":"EC '24: 25th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"New Haven CT USA","acronym":"EC '24"},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673495","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:42Z","timestamp":1750291542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":45,"alternative-id":["10.1145\/3670865.3673495","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673495","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-12-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}