{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T22:14:24Z","timestamp":1778883264135,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["8588"],"award-info":[{"award-number":["8588"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s43069-021-00115-7","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T10:25:43Z","timestamp":1648203943000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two-Person Fair Division of Indivisible Items when Envy-Freeness is Impossible"],"prefix":"10.1007","volume":"3","author":[{"given":"Steven J.","family":"Brams","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8810-8937","authenticated-orcid":false,"given":"D. Marc","family":"Kilgour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Klamler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"key":"115_CR1","doi-asserted-by":"crossref","unstructured":"Aziz H, Caragiannis I, Igarashi A, Walsh T (2019) Fair allocation of combinations of indivisible goods and chores. Proc Twenty-Eighth Int Joint Conf Artificial Intel (IJCAI-19)\u00a053\u201359","DOI":"10.24963\/ijcai.2019\/8"},{"key":"115_CR2","doi-asserted-by":"crossref","unstructured":"Barber\u00e0 S, Bossert W, Pattanaik PK (2004) Ranking sets of objects. In Barber\u00e0, S., Hammond, P.J., and C. Seidl (eds). Handbook Util Theor. Springer, Boston, MA","DOI":"10.1007\/978-1-4020-7964-1"},{"key":"115_CR3","unstructured":"Bil\u00f2 V, Caragiannis I, Flammini M, Igarashi A, Monaco G, Peters D, Vinci C, Zwicker WS (2018) Almost envy-free allocations with connected bundles.\u00a0arXiv:1808.09406"},{"key":"115_CR4","doi-asserted-by":"crossref","unstructured":"Bouveret S, Chevaleyre Y, Maudet N (2016) Fair allocation of indivisible goods. In Brandt, F., Conitzer, V., Endriss, U., Lang, J., and A.D. Procaccia (eds). Handbook of computational social choice, Cambridge University Press, New York. 284\u2013310","DOI":"10.1017\/CBO9781107446984.013"},{"key":"115_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s003550050019","volume":"17","author":"SJ Brams","year":"2000","unstructured":"Brams SJ, Fishburn P (2000) Fair division of indivisible items between two people with identical preferences: envy-freeness, Pareto-optimality, and equity. Soc Choice Welfare 17:247\u2013267","journal-title":"Soc Choice Welfare"},{"key":"115_CR6","doi-asserted-by":"crossref","unstructured":"Brams SJ, Kilgour DM, Klamler C (2012) The undercut procedure: an algorithm for the envy-free division of indivisible items. Soc Choice Welfare 39(2\u20133): 615\u2013631","DOI":"10.1007\/s00355-011-0599-1"},{"key":"115_CR7","doi-asserted-by":"crossref","unstructured":"Brams SJ, Kilgour DM, Klamler C (2014) Two-person fair division of indivisible items: an efficient, envy-free algorithm. Notices of the AMS 61(2):130\u2013141","DOI":"10.1090\/noti1075"},{"key":"115_CR8","doi-asserted-by":"crossref","unstructured":"Brams SJ, Kilgour DM, Klamler C (2015) How to divide things fairly. Math Magazine 88(5):338\u2013348","DOI":"10.4169\/math.mag.88.5.338"},{"key":"115_CR9","doi-asserted-by":"crossref","unstructured":"Brams SJ, Kilgour DM, Klamler C (2017) Maximin envy-free division of indivisible items. Group Decis Negot\u00a046(1):115\u2013131","DOI":"10.1007\/s10726-016-9502-x"},{"key":"115_CR10","doi-asserted-by":"crossref","unstructured":"Brams SJ, King D (2005) Efficient fair division: help the worst off or avoid envy? Rational Soc\u00a017(4):387\u2013421","DOI":"10.1177\/1043463105058317"},{"issue":"6","key":"115_CR11","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish E (2011) The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J Polit Econ 119(6):1061\u20131103","journal-title":"J Polit Econ"},{"key":"115_CR12","doi-asserted-by":"crossref","unstructured":"Caragiannis I, Gravin N, Huang X (2019a) Envy-freeness up to any item with high Nash welfare: the virtue of donating items. Proc of the 2019 ACM Conf Econ Comput (EC-19):527\u2013545","DOI":"10.1145\/3328526.3329574"},{"key":"115_CR13","doi-asserted-by":"crossref","unstructured":"Caragiannis I, Kurokawa D, Moulin H, Procaccia AD, Shah N, Wang J (2019b) The unreasonable fairness of maximum Nash welfare. ACM Transact Econ Comput\u00a07(3)","DOI":"10.1145\/3355902"},{"issue":"2","key":"115_CR14","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ejor.2018.05.057","volume":"271","author":"DM Kilgour","year":"2018","unstructured":"Kilgour DM, Vetschera R (2018) Two-player fair division of indivisible items: comparison of algorithms. Eur J Oper Res 271(2):620\u2013631","journal-title":"Eur J Oper Res"},{"key":"115_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-030-49629-6_12","volume-title":"Handbook of group decision and negotiation","author":"C Klamler","year":"2021","unstructured":"Klamler C (2021) The notion of fair division in negotiations. In: Kilgour DM, Eden C (eds) Handbook of group decision and negotiation, 2nd edn. Springer, Cham, 81\u2013109","edition":"2"},{"issue":"2","key":"115_CR16","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/19M124397X","volume":"34","author":"B Plaut","year":"2020","unstructured":"Plaut B, Roughgarden T (2020) Almost envy-freeness with general valuations. SIAM J Discret Math 34(2):1039\u20131068","journal-title":"SIAM J Discret Math"},{"key":"115_CR17","first-page":"305","volume":"2012","author":"K Pruhs","year":"2012","unstructured":"Pruhs K, Woeginger GJ (2012) Divorcing made easy FUN 2012:305\u2013314","journal-title":"Divorcing made easy FUN"},{"issue":"3","key":"115_CR18","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1257\/aer.89.3.349","volume":"89","author":"A Sen","year":"1999","unstructured":"Sen A (1999) The possibility of social choice. Am Econ Rev 89(3):349\u2013378","journal-title":"American Economic Review"},{"key":"115_CR19","volume-title":"Enumerative combinatorics","author":"RP Stanley","year":"2015","unstructured":"Stanley RP (2015) Enumerative combinatorics. Cambridge University Press, Cambridge, UK, 2"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00115-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-021-00115-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00115-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T04:23:21Z","timestamp":1656563001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-021-00115-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,24]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["115"],"URL":"https:\/\/doi.org\/10.1007\/s43069-021-00115-7","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,24]]},"assertion":[{"value":"2 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"24"}}