{"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":1750220363250,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"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":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["Investing for the Future ? PIA3"],"award-info":[{"award-number":["Investing for the Future ? PIA3"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell'Istruzione, dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["PRIN project ALGADIMAR"],"award-info":[{"award-number":["PRIN project ALGADIMAR"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["ICT-48, grant agreement 951847"],"award-info":[{"award-number":["ICT-48, grant agreement 951847"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["Advanced Grant 788893 AMDROMA"],"award-info":[{"award-number":["Advanced Grant 788893 AMDROMA"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467645","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:50Z","timestamp":1626604130000},"page":"289-309","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A Regret Analysis of Bilateral Trade"],"prefix":"10.1145","author":[{"given":"Nicol\u00f2","family":"Cesa-Bianchi","sequence":"first","affiliation":[{"name":"Universit\u00e0 degli Studi di Milano, Milan, Italy"}]},{"given":"Tommaso R.","family":"Cesari","sequence":"additional","affiliation":[{"name":"Toulouse School of Economics, Toulouse, France"}]},{"given":"Roberto","family":"Colomboni","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Milano & Istituto Italiano di Tecnologia, Genoa & Milan, Italy"}]},{"given":"Federico","family":"Fusco","sequence":"additional","affiliation":[{"name":"Sapienza Universit\u00e0 di Roma, Rome, Italy"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[{"name":"Sapienza Universit\u00e0 di Roma, Rome, Italy"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"volume-title":"ACM Conference on Economics and Computation, EC'14","author":"Agrawal Shipra","key":"e_1_3_2_1_1_1","unstructured":"Shipra Agrawal and Nikhil R. Devanur . 2014. Bandits with concave rewards and convex knapsacks . In ACM Conference on Economics and Computation, EC'14 . ACM, Association for Computing Machinery, New York, NY, USA, 989--1006. Shipra Agrawal and Nikhil R. Devanur. 2014. Bandits with concave rewards and convex knapsacks. In ACM Conference on Economics and Computation, EC'14. ACM, Association for Computing Machinery, New York, NY, USA, 989--1006."},{"volume-title":"Advances in Neural Information Processing Systems","author":"Amin Kareem","key":"e_1_3_2_1_2_1","unstructured":"Kareem Amin , Afshin Rostamizadeh , and Umar Syed . 2013. Learning prices for repeated auctions with strategic buyers . In Advances in Neural Information Processing Systems . Curran Associates Inc., Red Hook, NY, USA , 1169--1177. Kareem Amin, Afshin Rostamizadeh, and Umar Syed. 2013. Learning prices for repeated auctions with strategic buyers. In Advances in Neural Information Processing Systems. Curran Associates Inc., Red Hook, NY, USA, 1169--1177."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3037382"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559152"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164539"},{"key":"e_1_3_2_1_6_1","volume-title":"Sample Complexity of Automated Mechanism Design. In Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016","author":"Balcan Maria-Florina","year":"2016","unstructured":"Maria-Florina Balcan , Tuomas Sandholm , and Ellen Vitercik . 2016 . Sample Complexity of Automated Mechanism Design. In Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016 , December 5 --10 , 2016, Barcelona, Spain. Curran Associates Inc., Red Hook, NY, USA, 2083--2091. Maria-Florina Balcan, Tuomas Sandholm, and Ellen Vitercik. 2016. Sample Complexity of Automated Mechanism Design. In Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5--10, 2016, Barcelona, Spain. Curran Associates Inc., Red Hook, NY, USA, 2083--2091."},{"key":"e_1_3_2_1_7_1","volume-title":"Renato Paes Leme, and Song Zuo","author":"Balseiro Santiago R.","year":"2019","unstructured":"Santiago R. Balseiro , Vahab Mirrokni , Renato Paes Leme, and Song Zuo . 2019 . Dynamic Double Auctions: Towards First Best .Society for Industrial and Applied Mathematics, USA , 157--172. Santiago R. Balseiro, Vahab Mirrokni, Renato Paes Leme, and Song Zuo. 2019. Dynamic Double Auctions: Towards First Best .Society for Industrial and Applied Mathematics, USA, 157--172."},{"volume-title":"ACM-SIAM Symposium on Discrete Algorithms, SODA'05","author":"Blum Avrim","key":"e_1_3_2_1_8_1","unstructured":"Avrim Blum and Jason D. Hartline . 2005. Near-optimal online auctions . In ACM-SIAM Symposium on Discrete Algorithms, SODA'05 . Society for Industrial and Applied Mathematics, Society for Industrial and Applied Mathematics, USA, 1156--1163. Avrim Blum and Jason D. Hartline. 2005. Near-optimal online auctions. In ACM-SIAM Symposium on Discrete Algorithms, SODA'05. Society for Industrial and Applied Mathematics, Society for Industrial and Applied Mathematics, USA, 1156--1163."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.05.012"},{"key":"e_1_3_2_1_10_1","volume-title":"Reallocation Mechanisms. In Proceedings of the Fifteenth ACM Conference on Economics and Computation (EC '14)","author":"Blumrosen Liad","year":"2014","unstructured":"Liad Blumrosen and Shahar Dobzinski . 2014 . Reallocation Mechanisms. In Proceedings of the Fifteenth ACM Conference on Economics and Computation (EC '14) . Association for Computing Machinery, New York, NY, USA, 617. Liad Blumrosen and Shahar Dobzinski. 2014. Reallocation Mechanisms. In Proceedings of the Fifteenth ACM Conference on Economics and Computation (EC '14). Association for Computing Machinery, New York, NY, USA, 617."},{"key":"e_1_3_2_1_11_1","volume-title":"abs\/1604.04876","author":"Blumrosen Liad","year":"2016","unstructured":"Liad Blumrosen and Shahar Dobzinski . 2016. (Almost) Efficient Mechanisms for Bilateral Trading . Co RR , Vol . abs\/1604.04876 ( 2016 ), 1--16. Liad Blumrosen and Shahar Dobzinski. 2016. (Almost) Efficient Mechanisms for Bilateral Trading. CoRR, Vol. abs\/1604.04876 (2016), 1--16."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1057"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085148"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085145"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Nicol\u00f2 Cesa-Bianchi Tommaso Cesari Roberto Colomboni Federico Fusco and Stefano Leonardi. 2021. A Regret Analysis of Bilateral Trade. (2021).  Nicol\u00f2 Cesa-Bianchi Tommaso Cesari Roberto Colomboni Federico Fusco and Stefano Leonardi. 2021. A Regret Analysis of Bilateral Trade. (2021).","DOI":"10.1145\/3465456.3467645"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 30th International Conference on Algorithmic Learning Theory (Proceedings of Machine Learning Research), Aur\u00e9lien Garivier and Satyen Kale (Eds.)","volume":"98","author":"Cesa-Bianchi Nicol\u00f2","year":"2019","unstructured":"Nicol\u00f2 Cesa-Bianchi , Tommaso Cesari , and Vianney Perchet . 2019 . Dynamic Pricing with Finitely Many Unknown Valuations . In Proceedings of the 30th International Conference on Algorithmic Learning Theory (Proceedings of Machine Learning Research), Aur\u00e9lien Garivier and Satyen Kale (Eds.) , Vol. 98 . PMLR, Chicago, Illinois, 247--273. Nicol\u00f2 Cesa-Bianchi, Tommaso Cesari, and Vianney Perchet. 2019. Dynamic Pricing with Finitely Many Unknown Valuations. In Proceedings of the 30th International Conference on Algorithmic Learning Theory (Proceedings of Machine Learning Research), Aur\u00e9lien Garivier and Satyen Kale (Eds.), Vol. 98. PMLR, Chicago, Illinois, 247--273."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2365772"},{"volume-title":"Prediction, learning, and games","author":"Cesa-Bianchi Nicol\u00f2","key":"e_1_3_2_1_19_1","unstructured":"Nicol\u00f2 Cesa-Bianchi and G\u00e1 bor Lugosi . 2006. Prediction, learning, and games . Cambridge University Press , UK. Nicol\u00f2 Cesa-Bianchi and G\u00e1 bor Lugosi. 2006. Prediction, learning, and games .Cambridge University Press, UK."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0206"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2019.3485"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591867"},{"key":"e_1_3_2_1_23_1","volume-title":"Approximately Efficient Double Auctions with Strong Budget Balance. In ACM-SIAM Symposium on Discrete Algorithms, SODA'16","author":"Colini-Baldeschi Riccardo","year":"2016","unstructured":"Riccardo Colini-Baldeschi , Bart de Keijzer , Stefano Leonardi , and Stefano Turchetta . 2016 . Approximately Efficient Double Auctions with Strong Budget Balance. In ACM-SIAM Symposium on Discrete Algorithms, SODA'16 . SIAM, USA, 1424--1443. Riccardo Colini-Baldeschi, Bart de Keijzer, Stefano Leonardi, and Stefano Turchetta. 2016. Approximately Efficient Double Auctions with Strong Budget Balance. In ACM-SIAM Symposium on Discrete Algorithms, SODA'16. SIAM, USA, 1424--1443."},{"volume-title":"Web and Internet Economics, WINE'17 (Lecture Notes in Computer Science)","author":"Colini-Baldeschi Riccardo","key":"e_1_3_2_1_24_1","unstructured":"Riccardo Colini-Baldeschi , Paul W. Goldberg , Bart de Keijzer , Stefano Leonardi , and Stefano Turchetta . 2017. Fixed Price Approximability of the Optimal Gain from Trade . In Web and Internet Economics, WINE'17 (Lecture Notes in Computer Science) , Vol. 10660 . Springer , Germany , 146--160. Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, and Stefano Turchetta. 2017. Fixed Price Approximability of the Optimal Gain from Trade. In Web and Internet Economics, WINE'17 (Lecture Notes in Computer Science), Vol. 10660. Springer, Germany, 146--160."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.31"},{"key":"e_1_3_2_1_26_1","volume-title":"Dynamic pricing and learning: historical origins, current research, and new directions. Surveys in operations research and management science","author":"den Boer Arnoud V.","year":"2015","unstructured":"Arnoud V. den Boer . 2015. Dynamic pricing and learning: historical origins, current research, and new directions. Surveys in operations research and management science , Vol. 20 , 1 ( 2015 ), 1--18. Arnoud V. den Boer. 2015. Dynamic pricing and learning: historical origins, current research, and new directions. Surveys in operations research and management science, Vol. 20, 1 (2015), 1--18."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2019.3446"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2019.01.001"},{"key":"e_1_3_2_1_29_1","volume-title":"International Conference on Machine Learning, ICML'18 (Proceedings of Machine Learning Research)","volume":"80","author":"Drutsa Alexey","year":"2018","unstructured":"Alexey Drutsa . 2018 . Weakly consistent optimal pricing algorithms in repeated posted-price auctions with strategic buyer . In International Conference on Machine Learning, ICML'18 (Proceedings of Machine Learning Research) , Vol. 80 . PMLR, USA, 1318--1327. Alexey Drutsa. 2018. Weakly consistent optimal pricing algorithms in repeated posted-price auctions with strategic buyer. In International Conference on Machine Learning, ICML'18 (Proceedings of Machine Learning Research), Vol. 80. PMLR, USA, 1318--1327."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Paul D\u00fc tting Federico Fusco Philip Lazos Stefano Leonardi and Rebecca Reiffenh\"a user. 2021. Efficient Two-Sided Markets with Limited Information.  Paul D\u00fc tting Federico Fusco Philip Lazos Stefano Leonardi and Rebecca Reiffenh\"a user. 2021. Efficient Two-Sided Markets with Limited Information.","DOI":"10.1145\/3406325.3451076"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(87)90104-9"},{"volume-title":"IEEE Symposium on Foundations of Computer Science FOCS'13","author":"Robert","key":"e_1_3_2_1_32_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 IEEE Symposium on Foundations of Computer Science FOCS'13 . IEEE Computer Society, USA, 594--605. Robert D. Kleinberg and Frank Thomson Leighton. 2003. The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions. In IEEE Symposium on Foundations of Computer Science FOCS'13. IEEE Computer Society, USA, 594--605."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884444"},{"volume-title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","author":"Mitzenmacher Michael","key":"e_1_3_2_1_34_1","unstructured":"Michael Mitzenmacher and Eli Upfal . 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis , Second Edition .Cambridge university press, UK. Michael Mitzenmacher and Eli Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis, Second Edition .Cambridge university press, UK."},{"key":"e_1_3_2_1_35_1","volume-title":"USA","author":"Mohri Mehryar","year":"2014","unstructured":"Mehryar Mohri and Andres Munoz Medina . 2014 . Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers. In Advances in Neural Information Processing Systems. NeurIPS , USA , 1871--1879. Mehryar Mohri and Andres Munoz Medina. 2014. Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers. In Advances in Neural Information Processing Systems. NeurIPS, USA, 1871--1879."},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems -","volume":"1","author":"Morgenstern Jamie","year":"2015","unstructured":"Jamie Morgenstern and Tim Roughgarden . 2015 . The Pseudo-Dimension of near-Optimal Auctions . In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1 (NIPS'15). MIT Press, Cambridge, MA, USA, 136--144. Jamie Morgenstern and Tim Roughgarden. 2015. The Pseudo-Dimension of near-Optimal Auctions. In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1 (NIPS'15). MIT Press, Cambridge, MA, USA, 136--144."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(83)90048-0"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680836219"},{"volume-title":"Dynamic Pricing Under Model Uncertainty. Tutorial given at the 16th ACM Conference on Economics and Computation","author":"Slivkins Aleksandrs","key":"e_1_3_2_1_39_1","unstructured":"Aleksandrs Slivkins and Assaf Zeevi . 2015. Dynamic Pricing Under Model Uncertainty. Tutorial given at the 16th ACM Conference on Economics and Computation . Aleksandrs Slivkins and Assaf Zeevi. 2015. Dynamic Pricing Under Model Uncertainty. Tutorial given at the 16th ACM Conference on Economics and Computation."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"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.3467645","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467645","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.3467645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":40,"alternative-id":["10.1145\/3465456.3467645","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467645","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"}}]}}