{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:29:07Z","timestamp":1767320947339,"version":"3.48.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032085597","type":"print"},{"value":"9783032085603","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-08560-3_13","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:24:08Z","timestamp":1767320648000},"page":"225-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithmic Theory of\u00a0Simplicity in\u00a0Mechanism Design"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7962-5200","authenticated-orcid":false,"given":"Diodato","family":"Ferraioli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1464-1215","authenticated-orcid":false,"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"13_CR1","unstructured":"Archbold, T., De Keijzer, B., Ventre, C.: Willy wonka mechanisms. In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2024) (2024)"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.3982\/TE5111","volume":"18","author":"RP Arribillaga","year":"2023","unstructured":"Arribillaga, R.P., Mass\u00f3, J., Neme, A.: All sequential allotment rules are obviously strategy-proof. Theor. Econ. 18(3), 1023\u20131061 (2023)","journal-title":"Theor. Econ."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.jet.2018.07.001","volume":"177","author":"I Ashlagi","year":"2018","unstructured":"Ashlagi, I., Gonczarowski, Y.A.: Stable matching mechanisms are not obviously strategy-proof. J. Econ. Theory 177, 405\u2013425 (2018)","journal-title":"J. Econ. Theory"},{"issue":"5","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1257\/0002828043052330","volume":"94","author":"LM Ausubel","year":"2004","unstructured":"Ausubel, L.M.: An efficient ascending-bid auction for multiple objects. Am. Econ. Rev. 94(5), 1452\u20131475 (2004)","journal-title":"Am. Econ. Rev."},{"key":"13_CR5","unstructured":"Ferraioli, D., Meier, A., Penna, P., Ventre, C.: Obviously strategyproof mechanisms for machine scheduling. In: Bender, M.A., Svensson, O., Herman, G. (eds.) 27th Annual European Symposium on Algorithms, ESA 2019, vol.\u00a0144, pp. 46:1\u201346:15 (2019)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1287\/moor.2022.1264","volume":"48","author":"D Ferraioli","year":"2023","unstructured":"Ferraioli, D., Meier, A., Penna, P., Ventre, C.: New constructions of obviously strategyproof mechanisms. Math. Oper. Res. 48(1), 332\u2013362 (2023)","journal-title":"Math. Oper. Res."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-94676-0_1","volume-title":"Web and Internet Economics","author":"D Ferraioli","year":"2022","unstructured":"Ferraioli, D., Penna, P., Ventre, C.: Two-way greedy: algorithms for\u00a0imperfect rationality. In: Feldman, M., Fu, H., Talgam-Cohen, I. (eds.) WINE 2021. LNCS, vol. 13112, pp. 3\u201321. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94676-0_1"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Ferraioli, D., Ventre, C.: Probabilistic verification for obviously strategyproof mechanisms. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18, pp. 240\u2013246 (2018)","DOI":"10.24963\/ijcai.2018\/33"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00453-020-00771-x","volume":"83","author":"D Ferraioli","year":"2021","unstructured":"Ferraioli, D., Ventre, C.: Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location. Algorithmica 83(2), 695\u2013725 (2021)","journal-title":"Algorithmica"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/s00224-022-10071-2","volume":"66","author":"D Ferraioli","year":"2022","unstructured":"Ferraioli, D., Ventre, C.: Obvious strategyproofness, bounded rationality and approximation. Theory Comput. Syst. 66(3), 696\u2013720 (2022)","journal-title":"Theory Comput. Syst."},{"key":"13_CR11","unstructured":"Ferraioli, D., Ventre, C.: Explicit payments for obviously strategyproof mechanisms. In: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2023, London, United Kingdom, 29 May\u20132 June 2023, pp. 21257\u201321336. ACM (2023)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Ferraioli, D., Ventre, C.: On the connection between greedy algorithms and imperfect rationality. In: Leyton-Brown, K., Hartline, J.D., Samuelson, L. (eds.) Proceedings of the 24th ACM Conference on Economics and Computation, EC 2023, London, United Kingdom, 9\u201312 July 2023, pp. 657\u2013677. ACM (2023)","DOI":"10.1145\/3580507.3597755"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Hausmann, D., Korte, B., Jenkyns, T.A.: Worst case analysis of greedy type algorithms for independence systems. In: Combinatorial Optimization, pp. 120\u2013131 (1980)","DOI":"10.1007\/BFb0120891"},{"issue":"6","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.2307\/1913557","volume":"55","author":"JH Kagel","year":"1987","unstructured":"Kagel, J.H., Harstad, R.M., Levin, D.: Information impact and allocation rules in auctions with affiliated private values: a laboratory study. Econometrica 55(6), 1275\u20131304 (1987)","journal-title":"Econometrica"},{"key":"13_CR15","unstructured":"de\u00a0Keijzer, B., Kyropoulou, M., Ventre, C.: Obviously strategyproof single-minded combinatorial auctions. In: ICALP, pp. 71:1\u201371:17 (2020)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Li, S.: Obviously strategy-proof mechanisms. Am. Econ. Rev. 107(11), 3257\u20133287 (2017)","DOI":"10.1257\/aer.20160425"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.geb.2020.09.010","volume":"124","author":"A Mackenzie","year":"2020","unstructured":"Mackenzie, A.: A revelation principle for obviously strategy-proof implementation. Games Econ. Behav. 124, 512\u2013533 (2020)","journal-title":"Games Econ. Behav."},{"key":"13_CR18","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.): Algorithmic Game Theory (2017)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Pycia, M., Troyan, P.: Obvious dominance and random priority. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC \u201919, p.\u00a01. Association for Computing Machinery, New York (2019)","DOI":"10.1145\/3328526.3329613"},{"issue":"4","key":"13_CR20","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.3982\/ECTA16310","volume":"91","author":"M Pycia","year":"2023","unstructured":"Pycia, M., Troyan, P.: A theory of simplicity in games and mechanism design. Econometrica 91(4), 1495\u20131526 (2023)","journal-title":"Econometrica"},{"key":"13_CR21","unstructured":"Savage, L.: Foundations of Statistics. John Wiley and Sons, Hoboken (1954)"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1111\/iere.12384","volume":"60","author":"P Troyan","year":"2019","unstructured":"Troyan, P.: Obviously strategy-proof implementation of top trading cycles. Int. Econ. Rev. 60(3), 1249\u20131261 (2019)","journal-title":"Int. Econ. Rev."},{"key":"13_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.104970","volume":"185","author":"P Troyan","year":"2020","unstructured":"Troyan, P., Morrill, T.: Obvious manipulations. J. Econ. Theory 185, 104970 (2020)","journal-title":"J. Econ. Theory"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08560-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:24:09Z","timestamp":1767320649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08560-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032085597","9783032085603"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08560-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}