{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T22:31:53Z","timestamp":1772317913724,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T00:00:00Z","timestamp":1655424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T00:00:00Z","timestamp":1655424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000269","name":"Economic and Social Research Council","doi-asserted-by":"publisher","award":["R1379QMs"],"award-info":[{"award-number":["R1379QMs"]}],"id":[{"id":"10.13039\/501100000269","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israeli Science Foundation","doi-asserted-by":"crossref","award":["712\/20"],"award-info":[{"award-number":["712\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc Choice Welf"],"published-print":{"date-parts":[[2022,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the classical cake-cutting problem, strategy-proofness is a very costly requirement in terms of fairness: for <jats:inline-formula><jats:alternatives><jats:tex-math>$$n=2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> it implies a dictatorial allocation, whereas for <jats:inline-formula><jats:alternatives><jats:tex-math>$$n\\ge 3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> it implies that one agent receives no cake. We show that a weaker version of this property recently suggested by Troyan and Morril (J Econ Theory 185:104970, 2019) is compatible with the fairness property of proportionality, which guarantees that each agent receives 1\/<jats:italic>n<\/jats:italic> of the cake. Both properties are satisfied by the leftmost-leaves mechanism, an adaptation of the Dubins\u2013Spanier moving knife procedure. Most other classical proportional mechanisms in the literature are obviously manipulable, including the original moving knife mechanism and some other variants of it.<\/jats:p>","DOI":"10.1007\/s00355-022-01416-4","type":"journal-article","created":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T04:02:27Z","timestamp":1655438547000},"page":"969-988","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Obvious manipulations in cake-cutting"],"prefix":"10.1007","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5080-2058","authenticated-orcid":false,"given":"Josu\u00e9","family":"Ortega","sequence":"first","affiliation":[]},{"given":"Erel","family":"Segal-Halevi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,17]]},"reference":[{"key":"1416_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-030-87756-9_12","volume-title":"International conference on algorithmic decision theory","author":"H Aziz","year":"2021","unstructured":"Aziz H, Lam A (2021) Obvious manipulability of voting rules. International conference on algorithmic decision theory. Springer, Berlin, pp 179\u2013193"},{"key":"1416_CR2","first-page":"1","volume-title":"International conference on web and internet economics","author":"H Aziz","year":"2014","unstructured":"Aziz H, Ye C (2014) Cake cutting algorithms for piecewise constant and piecewise uniform valuations. International conference on web and internet economics. Springer, Berlin, pp 1\u201314"},{"key":"1416_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.econlet.2020.109064","volume":"190","author":"B Bhardwaj","year":"2020","unstructured":"Bhardwaj B, Kumar R, Ortega J (2020) Fairness and efficiency in cake-cutting with single-peaked preferences. Econ Lett 190:109064","journal-title":"Econ Lett"},{"key":"1416_CR4","doi-asserted-by":"crossref","unstructured":"Bogomolnaia A, Moulin H (2022) Guarantees in fair division: general or monotone preferences. Math Oper Res","DOI":"10.1287\/moor.2022.1255"},{"key":"1416_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair division: from cake-cutting to dispute resolution","author":"S Brams","year":"1996","unstructured":"Brams S, Taylor A (1996) Fair division: from cake-cutting to dispute resolution. Cambridge University Press, Cambridge"},{"key":"1416_CR6","first-page":"1314","volume":"53","author":"S Brams","year":"2006","unstructured":"Brams S, Jones M, Klamler C (2006) Better ways to cut a cake. Not AMS 53:1314\u20131321","journal-title":"Not AMS"},{"key":"1416_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00182-007-0108-z","volume":"36","author":"SJ Brams","year":"2008","unstructured":"Brams SJ, Jones MA, Klamler C (2008) Proportional pie-cutting. Internat J Game Theory 36:353\u2013367","journal-title":"Internat J Game Theory"},{"key":"1416_CR8","first-page":"481","volume-title":"Twenty-fourth international joint conference on artificial intelligence","author":"S Br\u00e2nzei","year":"2015","unstructured":"Br\u00e2nzei S, Miltersen PB (2015) A dictatorship theorem for cake cutting. Twenty-fourth international joint conference on artificial intelligence. AAAI Press, London, pp 481\u2013488"},{"key":"1416_CR9","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2012.10.009","volume":"77","author":"Y Chen","year":"2013","unstructured":"Chen Y, Lai J, Parkes D, Procaccia A (2013) Truth, justice, and cake cutting. Games Econ Behav 77:284\u2013297","journal-title":"Games Econ Behav"},{"key":"1416_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00029890.1961.11989615","volume":"68","author":"L Dubins","year":"1961","unstructured":"Dubins L, Spanier E (1961) How to cut a cake fairly. Amer Math Mon 68:1\u201317","journal-title":"Amer Math Mon"},{"key":"1416_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0166-218X(84)90005-2","volume":"7","author":"S Even","year":"1984","unstructured":"Even S, Paz A (1984) A note on cake cutting. Discret Appl Math 7:285\u2013296","journal-title":"Discret Appl Math"},{"key":"1416_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1515\/9781400877386-004","volume-title":"On games of fair division, Essays in mathematical economics in honor of Oskar Morgenstern","author":"HW Kuhn","year":"1967","unstructured":"Kuhn HW (1967) On games of fair division, Essays in mathematical economics in honor of Oskar Morgenstern. Princeton University Press, Princeton, pp 29\u201338"},{"key":"1416_CR13","doi-asserted-by":"crossref","unstructured":"Kurokawa D, Lai JK, Procaccia AD (2013) How to cut a cake before the party ends. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence, pp 555\u2013561","DOI":"10.1609\/aaai.v27i1.8629"},{"key":"1416_CR14","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.geb.2022.01.027","volume":"133","author":"M Kyropoulou","year":"2022","unstructured":"Kyropoulou M, Ortega J, Segal-Halevi E (2022) Fair cake-cutting in practice. Games Econ Behav 133:28\u201349","journal-title":"Games Econ Behav"},{"key":"1416_CR15","doi-asserted-by":"crossref","unstructured":"Menon V, Larson K (2017) Deterministic, strategyproof, and fair cake cutting. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp 352\u2013358","DOI":"10.24963\/ijcai.2017\/50"},{"key":"1416_CR16","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.2307\/1911364","volume":"56","author":"J Moore","year":"1988","unstructured":"Moore J, Repullo R (1988) Subgame perfect implementation. Econometrica 56:1191\u20131220","journal-title":"Econometrica"},{"key":"1416_CR17","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-16170-4_25","volume-title":"Algorithmic game theory","author":"E Mossel","year":"2010","unstructured":"Mossel E, Tamuz O (2010) Truthful fair division. In: Kontogiannis S, Koutsoupias E, Spirakis P (eds) Algorithmic game theory. Springer, Berlin, pp 288\u2013299"},{"key":"1416_CR18","volume-title":"Fair division and collective welfare","author":"H Moulin","year":"2004","unstructured":"Moulin H (2004) Fair division and collective welfare. MIT Press, London"},{"key":"1416_CR19","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.geb.2008.01.006","volume":"64","author":"A Nicol\u00f2","year":"2008","unstructured":"Nicol\u00f2 A, Yu Y (2008) Strategic divide and choose. Games Econ Behav 64:268\u2013289","journal-title":"Games Econ Behav"},{"key":"1416_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1017\/CBO9781107446984.014","volume-title":"Handbook of computational social choice","author":"A Procaccia","year":"2016","unstructured":"Procaccia A (2016) Cake cutting algorithms. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia A (eds) Handbook of computational social choice. Cambridge University Press, Cambridge, pp 311\u2013330"},{"key":"1416_CR21","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855","volume-title":"Cake-cutting algorithms: be fair if you can","author":"J Robertson","year":"1998","unstructured":"Robertson J, Webb W (1998) Cake-cutting algorithms: be fair if you can. AK Peters\/CRC Press, London"},{"key":"1416_CR22","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s00355-019-01210-9","volume":"53","author":"E Segal-Halevi","year":"2019","unstructured":"Segal-Halevi E, Nitzan S (2019) Fair cake-cutting among families. Soc Choice Welf 53:709\u2013740","journal-title":"Soc Choice Welf"},{"key":"1416_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.mathsocsci.2018.07.001","volume":"95","author":"E Segal-Halevi","year":"2018","unstructured":"Segal-Halevi E, Sziklai BR (2018) Resource-monotonicity and population-monotonicity in connected cake-cutting. Math Soc Sci 95:19\u201330","journal-title":"Math Soc Sci"},{"key":"1416_CR24","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00199-018-1128-6","volume":"68","author":"E Segal-Halevi","year":"2019","unstructured":"Segal-Halevi E, Sziklai BR (2019) Monotonicity and competitive equilibrium in cake-cutting. Econ Theor 68:363\u2013401","journal-title":"Econ Theor"},{"key":"1416_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmateco.2017.01.007","volume":"70","author":"E Segal-Halevi","year":"2017","unstructured":"Segal-Halevi E, Nitzan S, Hassidim A, Aumann Y (2017) Fair and square: cake-cutting in two dimensions. J Math Econ 70:1\u201328","journal-title":"J Math Econ"},{"key":"1416_CR26","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus H (1948) The problem of fair division. Econometrica 16:101\u2013104","journal-title":"Econometrica"},{"key":"1416_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.104970","volume":"185","author":"P Troyan","year":"2019","unstructured":"Troyan P, Morrill T (2019) Obvious manipulations. J Econ Theory 185:104970","journal-title":"J Econ Theory"}],"container-title":["Social Choice and Welfare"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-022-01416-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00355-022-01416-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-022-01416-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T16:25:37Z","timestamp":1667665537000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00355-022-01416-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,17]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1416"],"URL":"https:\/\/doi.org\/10.1007\/s00355-022-01416-4","relation":{},"ISSN":["0176-1714","1432-217X"],"issn-type":[{"value":"0176-1714","type":"print"},{"value":"1432-217X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,17]]},"assertion":[{"value":"27 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}