{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:43:24Z","timestamp":1767339804638,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["PRIN 2017 Project ALGADIMAR ?Algorithms, Games, and Digital Markets?"],"award-info":[{"award-number":["PRIN 2017 Project ALGADIMAR ?Algorithms, Games, and Digital Markets?"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"publisher","award":["Trustworthy Autonomous Systems Hub (EP\/V00784X\/1)"],"award-info":[{"award-number":["Trustworthy Autonomous Systems Hub (EP\/V00784X\/1)"]}],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597755","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"657-677","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Connection between Greedy Algorithms and Imperfect Rationality"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7962-5200","authenticated-orcid":false,"given":"Diodato","family":"Ferraioli","sequence":"first","affiliation":[{"name":"University of Salerno, Fisciano (SA), Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1464-1215","authenticated-orcid":false,"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[{"name":"King's College London, London, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Sequential Posted Price Mechanisms with Correlated Valuations. In WINE","author":"Adamczyk M.","year":"2015","unstructured":"M. Adamczyk , A. Borodin , D. Ferraioli , B. de Keijzer , and S. Leonardi . 2015 . Sequential Posted Price Mechanisms with Correlated Valuations. In WINE 2015 . 1--15. M. Adamczyk, A. Borodin, D. Ferraioli, B. de Keijzer, and S. Leonardi. 2015. Sequential Posted Price Mechanisms with Correlated Valuations. In WINE 2015. 1--15."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1109\/FOCS.2018.00080"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/964725.633037"},{"volume-title":"Proceedings 42nd IEEE Symposium on Foundations of Computer Science. IEEE, 482--491","author":"Aaron","unstructured":"Aaron Archer and \u00c9va Tardos. 2001a. Truthful mechanisms for one-parameter agents . In Proceedings 42nd IEEE Symposium on Foundations of Computer Science. IEEE, 482--491 . Aaron Archer and \u00c9va Tardos. 2001a. Truthful mechanisms for one-parameter agents. In Proceedings 42nd IEEE Symposium on Foundations of Computer Science. IEEE, 482--491.","key":"e_1_3_2_1_4_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/SFCS.2001.959924"},{"unstructured":"R. P. Arribillaga J. Mass\u00f3 and A. Neme. 2019. All Sequential Allotment Rules Are Obviously Strategy-proof. (2019).  R. P. Arribillaga J. Mass\u00f3 and A. Neme. 2019. All Sequential Allotment Rules Are Obviously Strategy-proof. (2019).","key":"e_1_3_2_1_6_1"},{"doi-asserted-by":"crossref","unstructured":"R. P. Arribillaga J. Mass\u00f3 and A. Neme. 2020. On Obvious Strategy-proofness and Single-peakedness. Journal of Economic Theory (2020).  R. P. Arribillaga J. Mass\u00f3 and A. Neme. 2020. On Obvious Strategy-proofness and Single-peakedness. Journal of Economic Theory (2020).","key":"e_1_3_2_1_7_1","DOI":"10.1016\/j.jet.2020.104992"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1016\/j.jet.2018.07.001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/3037382"},{"key":"e_1_3_2_1_10_1","volume-title":"FOCS","author":"Babaioff M.","year":"2014","unstructured":"M. Babaioff , N. Immorlica , B. Lucier , and S M. Weinberg . 2014. A Simple and Approximately Optimal Mechanism for an Additive Buyer . In FOCS 2014 . 21--30. M. Babaioff, N. Immorlica, B. Lucier, and S M. Weinberg. 2014. A Simple and Approximately Optimal Mechanism for an Additive Buyer. In FOCS 2014. 21--30."},{"volume-title":"Proceedings of the 2017 ACM Conference on Economics and Computation","author":"Bade Sophie","unstructured":"Sophie Bade and Yannai A. Gonczarowski . 2017. Gibbard-Satterthwaite Success Stories and Obvious Strategyproofness . In Proceedings of the 2017 ACM Conference on Economics and Computation ( Cambridge, Massachusetts, USA) (EC '17). Association for Computing Machinery, New York, NY, USA, 565. Sophie Bade and Yannai A. Gonczarowski. 2017. Gibbard-Satterthwaite Success Stories and Obvious Strategyproofness. In Proceedings of the 2017 ACM Conference on Economics and Computation (Cambridge, Massachusetts, USA) (EC '17). Association for Computing Machinery, New York, NY, USA, 565.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","first-page":"180","article-title":"Auctions Versus Negotiations","volume":"86","author":"Bulow Jeremy","year":"1996","unstructured":"Jeremy Bulow and Paul Klemperer . 1996 . Auctions Versus Negotiations . The American Economic Review 86 , 1 (1996), 180 -- 194 . Jeremy Bulow and Paul Klemperer. 1996. Auctions Versus Negotiations. The American Economic Review 86, 1 (1996), 180--194.","journal-title":"The American Economic Review"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/CDC.2007.4435015"},{"volume-title":"Social design","author":"Chiu Jonathan","unstructured":"Jonathan Chiu and Thorsten Koeppl . 2019. Incentive compatibility on the blockchain . In Social design . Springer , 323--335. Jonathan Chiu and Thorsten Koeppl. 2019. Incentive compatibility on the blockchain. In Social design. Springer, 323--335.","key":"e_1_3_2_1_14_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.4230\/LIPIcs.ITCS.2022.49"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/FOCS52979.2021.00086"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/3564246.3585176"},{"volume-title":"EC 2017. 169--186","author":"Correa J.","unstructured":"J. Correa , P. Foncea , R. Hoeksma , T. Oosterwijk , and T. Vredeveld . 2017. Posted Price Mechanisms for a Random Stream of Customers . In EC 2017. 169--186 . J. Correa, P. Foncea, R. Hoeksma, T. Oosterwijk, and T. Vredeveld. 2017. Posted Price Mechanisms for a Random Stream of Customers. In EC 2017. 169--186.","key":"e_1_3_2_1_18_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/2746539.2746597"},{"key":"e_1_3_2_1_20_1","first-page":"1","article-title":"Obviously Strategyproof Single-Minded Combinatorial Auctions","volume":"71","author":"de Keijzer Bart","year":"2020","unstructured":"Bart de Keijzer , Maria Kyropoulou , and Carmine Ventre . 2020 . Obviously Strategyproof Single-Minded Combinatorial Auctions . In ICALP. 71 : 1 -- 71 :17. Bart de Keijzer, Maria Kyropoulou, and Carmine Ventre. 2020. Obviously Strategyproof Single-Minded Combinatorial Auctions. In ICALP. 71:1--71:17.","journal-title":"ICALP."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1287\/moor.2016.0835"},{"volume-title":"EC 2017. 323--323","author":"Eden A.","unstructured":"A. Eden , M. Feldman , O. Friedler , I. Talgam-Cohen , and S. M. Weinberg . 2017. A Simple and Approximately Optimal Mechanism for a Buyer with Complements . In EC 2017. 323--323 . A. Eden, M. Feldman, O. Friedler, I. Talgam-Cohen, and S. M. Weinberg. 2017. A Simple and Approximately Optimal Mechanism for a Buyer with Complements. In EC 2017. 323--323.","key":"e_1_3_2_1_22_1"},{"volume-title":"EC 2017. 405--422","author":"Feldman M.","unstructured":"M. Feldman , A. Fiat , and A. Roytman . 2017. Makespan Minimization via Posted Prices . In EC 2017. 405--422 . M. Feldman, A. Fiat, and A. Roytman. 2017. Makespan Minimization via Posted Prices. In EC 2017. 405--422.","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","volume-title":"Bayesian and Randomized Clock Auctions. CoRR abs\/2202.09291","author":"Feldman Michal","year":"2022","unstructured":"Michal Feldman , Vasilis Gkatzelis , Nick Gravin , and Daniel Schoepflin . 2022. Bayesian and Randomized Clock Auctions. CoRR abs\/2202.09291 ( 2022 ). arXiv:2202.09291 https:\/\/arxiv.org\/abs\/2202.09291 Michal Feldman, Vasilis Gkatzelis, Nick Gravin, and Daniel Schoepflin. 2022. Bayesian and Randomized Clock Auctions. CoRR abs\/2202.09291 (2022). arXiv:2202.09291 https:\/\/arxiv.org\/abs\/2202.09291"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"e_1_3_2_1_26_1","volume-title":"New Constructions of Obviously Strategyproof Mechanisms. Mathematics of Operations Research","author":"Ferraioli Diodato","year":"2022","unstructured":"Diodato Ferraioli , Adrian Meier , Paolo Penna , and Carmine Ventre . 2022. New Constructions of Obviously Strategyproof Mechanisms. Mathematics of Operations Research ( 2022 ). Diodato Ferraioli, Adrian Meier, Paolo Penna, and Carmine Ventre. 2022. New Constructions of Obviously Strategyproof Mechanisms. Mathematics of Operations Research (2022)."},{"key":"e_1_3_2_1_27_1","volume-title":"WINE 2021, Potsdam, Germany, December 14--17, 2021, Proceedings (Lecture Notes in Computer Science","volume":"21","author":"Ferraioli Diodato","year":"2021","unstructured":"Diodato Ferraioli , Paolo Penna , and Carmine Ventre . 2021 . Two-Way Greedy: Algorithms for Imperfect Rationality. In Web and Internet Economics - 17th International Conference , WINE 2021, Potsdam, Germany, December 14--17, 2021, Proceedings (Lecture Notes in Computer Science , Vol. 13112). Springer, 3-- 21 . Diodato Ferraioli, Paolo Penna, and Carmine Ventre. 2021. Two-Way Greedy: Algorithms for Imperfect Rationality. In Web and Internet Economics - 17th International Conference, WINE 2021, Potsdam, Germany, December 14--17, 2021, Proceedings (Lecture Notes in Computer Science, Vol. 13112). Springer, 3--21."},{"key":"e_1_3_2_1_28_1","volume-title":"On the Connection between Greedy Algorithms and Imperfect Rationality. CoRR abs\/2302.13641","author":"Ferraioli Diodato","year":"2023","unstructured":"Diodato Ferraioli and Carmine Ventre . 2023. On the Connection between Greedy Algorithms and Imperfect Rationality. CoRR abs\/2302.13641 ( 2023 ). Diodato Ferraioli and Carmine Ventre. 2023. On the Connection between Greedy Algorithms and Imperfect Rationality. CoRR abs\/2302.13641 (2023)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/1566374.1566407"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1257\/aer.20160425"},{"volume-title":"A revelation principle for obviously strategy-proof implementation. Research Memorandum 014","author":"Mackenzie Andrew","unstructured":"Andrew Mackenzie . 2018. A revelation principle for obviously strategy-proof implementation. Research Memorandum 014 . Maastricht University , Graduate School of Business and Economics (GSBE). Andrew Mackenzie. 2018. A revelation principle for obviously strategy-proof implementation. Research Memorandum 014. Maastricht University, Graduate School of Business and Economics (GSBE).","key":"e_1_3_2_1_31_1"},{"volume-title":"Putting auction theory to work","author":"Milgrom Paul","unstructured":"Paul Milgrom and Paul Robert Milgrom . 2004. Putting auction theory to work . Cambridge University Press . Paul Milgrom and Paul Robert Milgrom. 2004. Putting auction theory to work. Cambridge University Press.","key":"e_1_3_2_1_32_1"},{"doi-asserted-by":"crossref","unstructured":"P. Milgrom and I. Segal. 2020. Clock Auctions and Radio Spectrum Reallocation. Journal of Political Economy (2020).  P. Milgrom and I. Segal. 2020. Clock Auctions and Radio Spectrum Reallocation. Journal of Political Economy (2020).","key":"e_1_3_2_1_33_1","DOI":"10.1086\/704074"},{"unstructured":"Noam Nisan Tim Roughgarden Eva Tardos and Vijay Vazirani (Eds.). 2017. Algorithmic Game Theory.  Noam Nisan Tim Roughgarden Eva Tardos and Vijay Vazirani (Eds.). 2017. Algorithmic Game Theory.","key":"e_1_3_2_1_34_1"},{"doi-asserted-by":"crossref","unstructured":"Noam Nisan Michael Schapira Gregory Valiant and Aviv Zohar. 2011. Best-Response Mechanisms.. In ICS. 155--165.  Noam Nisan Michael Schapira Gregory Valiant and Aviv Zohar. 2011. Best-Response Mechanisms.. In ICS. 155--165.","key":"e_1_3_2_1_35_1","DOI":"10.1145\/1993574.1993633"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1145\/3328526.3329613"},{"key":"e_1_3_2_1_37_1","volume-title":"Position auctions. international Journal of industrial Organization 25, 6","author":"Varian Hal R","year":"2007","unstructured":"Hal R Varian . 2007. Position auctions. international Journal of industrial Organization 25, 6 ( 2007 ), 1163--1178. Hal R Varian. 2007. Position auctions. international Journal of industrial Organization 25, 6 (2007), 1163--1178."}],"event":{"sponsor":["SIGecom Special Interest Group on Economics and Computation"],"acronym":"EC '23","name":"EC '23: 24th ACM Conference on Economics and Computation","location":"London United Kingdom"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597755","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:57Z","timestamp":1750182537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":37,"alternative-id":["10.1145\/3580507.3597755","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597755","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}