{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:06:20Z","timestamp":1768449980794,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T00:00:00Z","timestamp":1636416000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T00:00:00Z","timestamp":1636416000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18J009"],"award-info":[{"award-number":["18J009"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["AMPLify 670077"],"award-info":[{"award-number":["AMPLify 670077"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10458-021-09532-8","type":"journal-article","created":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T06:08:56Z","timestamp":1636438136000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Fair allocation of indivisible goods and chores"],"prefix":"10.1007","volume":"36","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[]},{"given":"Ioannis","family":"Caragiannis","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Igarashi","sequence":"additional","affiliation":[]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,9]]},"reference":[{"key":"9532_CR1","doi-asserted-by":"crossref","unstructured":"Aleksandrov, M., & Walsh, T. (2020). Two algorithms for additive and fair division of mixed manna. In KI 2020: Advances in artificial intelligence\u201443rd German conference on AI, Proceedings, Bamberg, Germany, September 21-25, 2020 (pp. 3\u201317).","DOI":"10.1007\/978-3-030-58285-2_1"},{"key":"9532_CR2","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Christodoulou, G., & Markakis, E. (2017). Truthful allocation mechanisms without payments: characterization and implications on fairness. In Proceedings of the 18th ACM conference on economics and computation (EC).","DOI":"10.1145\/3033274.3085147"},{"issue":"4","key":"9532_CR3","doi-asserted-by":"publisher","first-page":"52:1","DOI":"10.1145\/3147173","volume":"13","author":"G Amanatidis","year":"2017","unstructured":"Amanatidis, G., Markakis, E., Nikzad, A., & Saberi, A. (2017). Approximation algorithms for computing maximin share allocations. ACM Transactions on Algorithms, 13(4), 52:1-52:28.","journal-title":"ACM Transactions on Algorithms"},{"key":"9532_CR4","unstructured":"Aziz, H. (2016). Computational social choice: Some current and new directions. In Proceedings of the 25th international joint conference on artificial intelligence (IJCAI) (pp. 4054\u20134057)."},{"key":"9532_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., & Rey, S. (2020). Almost group envy-free allocation of indivisible goods and chores. In Proceedings of the 29th international joint conference on artificial intelligence (IJCAI) (pp. 39\u201345).","DOI":"10.24963\/ijcai.2020\/6"},{"key":"9532_CR6","unstructured":"Aziz, H., Biro, P., Lang, J., Lesca, J., & Monnot, J. (2016). Optimal reallocation under additive and ordinal preferences. In Proceedings of the 15th international conference on autonomous agents and multiagent systems (AAMAS) (pp. 402\u2013410)."},{"key":"9532_CR7","doi-asserted-by":"crossref","unstructured":"Aziz, H., Rauchecker, G., Schryen, G., & Walsh, T. (2017). Algorithms for max-min share fair allocation of indivisible chores. In Proceedings of the 31st AAAI conference on artificial intelligence (AAAI) (pp. 335\u2013341).","DOI":"10.1609\/aaai.v31i1.10582"},{"key":"9532_CR8","doi-asserted-by":"crossref","unstructured":"Aziz, H., Caragiannis, I., Igarashi, A., & Walsh, T. (2019). Fair allocation of indivisible goods and chores. In Proceedings of the 28th international joint conference on artificial intelligence (IJCAI) (pp. 53\u201359).","DOI":"10.24963\/ijcai.2019\/8"},{"issue":"5","key":"9532_CR9","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.orl.2020.07.005","volume":"48","author":"H Aziz","year":"2020","unstructured":"Aziz, H., Moulin, H., & Sandomirskiy, F. (2020). A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. Operations Research Letters, 48(5), 573\u2013578.","journal-title":"Operations Research Letters"},{"issue":"1","key":"9532_CR10","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/3381525","volume":"8","author":"S Barman","year":"2020","unstructured":"Barman, S., & Krishnamurthy, S. K. (2020). Approximation algorithms for maximin fair division. ACM Transactions on Economics and Computation, 8(1), 5:1-5:28.","journal-title":"ACM Transactions on Economics and Computation"},{"key":"9532_CR11","doi-asserted-by":"crossref","unstructured":"Barman, S., Kumar\u00a0Krishna Murthy, S., & Vaish, R. (2018). Finding fair and efficient allocations. In Proceedings of the 19th ACM conference on economics and computation (EC) (pp. 557\u2013574).","DOI":"10.1145\/3219166.3219176"},{"key":"9532_CR12","unstructured":"B\u00e9rczi, K., B\u00e9rczi-Kov\u00e1cs, E.\u00a0R., Boros, E., Gedefa, F.\u00a0T., Kamiyama, N., Kavitha, T., Kobayashi, Y., & Makino, K. (2020). Envy-free relaxations for goods, chores, and mixed items. CoRR arXiv:abs\/2006.04428."},{"key":"9532_CR13","unstructured":"Bhaskar, U., Sricharan, A.\u00a0R., & Vaish, R. (2020). On approximate envy-freeness for indivisible chores and mixed resources. CoRRarXiv:abs\/2012.06788."},{"key":"9532_CR14","unstructured":"Bil\u00f2, V., Caragiannis, I., Flammini, M., Igarashi, A., Monaco, G., Peters, D., Vinci, C., & Zwicker, W.\u00a0S. (2019). Almost envy-free allocations with connected bundles. In Proceedings of the 10th innovations in theoretical computer science conference (ITCS) (pp. 14:1\u201314:21)."},{"issue":"6","key":"9532_CR15","doi-asserted-by":"publisher","first-page":"1847","DOI":"10.3982\/ECTA14564","volume":"85","author":"A Bogomolnaia","year":"2017","unstructured":"Bogomolnaia, A., Moulin, H., Sandomirskyi, F., & Yanovskaya, E. (2017). Competitive division of a mixed manna. Econometrica, 85(6), 1847\u20131871.","journal-title":"Econometrica"},{"key":"9532_CR16","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00355-018-1157-x","volume":"52","author":"A Bogomolnaia","year":"2019","unstructured":"Bogomolnaia, A., Moulin, H., Sandomirskyi, F., & Yanovskaya, E. (2019). Dividing goods and bads under additive utilities. Social Choice and Welfare, 52, 395\u2013417.","journal-title":"Social Choice and Welfare"},{"key":"9532_CR17","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S Bouveret","year":"2008","unstructured":"Bouveret, S., & Lang, J. (2008). Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. Journal of Artificial Intelligence Research, 32, 525\u2013564.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9532_CR18","unstructured":"Bouveret, S., & Lang, J. (2011). A general elicitation-free protocol for allocating indivisible goods. In Proceedings of the 22nd international joint conference on artificial intelligence (IJCAI) (pp. 73\u201378). AAAI Press."},{"key":"9532_CR19","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1017\/CBO9781107446984.013","volume-title":"Handbook of computational social choice","author":"S Bouveret","year":"2016","unstructured":"Bouveret, S., Chevaleyre, Y., & Maudet, N. (2016). Chapter 12: Fair allocation of indivisible goods. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. D. Procaccia (Eds.), Handbook of computational social choice (pp. 284\u2013310). Cambridge University Press."},{"key":"9532_CR20","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Cechl\u00e1rov\u00e1, K., Elkind, E., Igarashi, A., & Peters, D. (2017). Fair division of a graph. In Proceedings of the 26th international joint conference on artificial intelligence (IJCAI) (pp. 135\u2013141).","DOI":"10.24963\/ijcai.2017\/20"},{"issue":"2","key":"9532_CR21","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s003550050019","volume":"17","author":"SJ Brams","year":"2000","unstructured":"Brams, S. J., & Fishburn, P. C. (2000). Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity. Social Choice and Welfare, 17(2), 247\u2013267.","journal-title":"Social Choice and Welfare"},{"key":"9532_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair division: From cake-cutting to dispute resolution","author":"SJ Brams","year":"1996","unstructured":"Brams, S. J., & Taylor, A. D. (1996). Fair division: From cake-cutting to dispute resolution. Cambridge University Press."},{"issue":"3","key":"9532_CR23","first-page":"191","volume":"13","author":"SJ Brams","year":"1996","unstructured":"Brams, S. J., & Taylor, A. D. (1996). A procedure for divorce settlements. Issue Mediation Quarterly Mediation Quarterly, 13(3), 191\u2013205.","journal-title":"Issue Mediation Quarterly Mediation Quarterly"},{"issue":"3","key":"9532_CR24","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/crq.3900130305","volume":"13","author":"SJ Brams","year":"1996","unstructured":"Brams, S. J., & Taylor, A. D. (1996). A procedure for divorce settlements. Mediation Quarterly, 13(3), 191\u2013205.","journal-title":"Mediation Quarterly"},{"issue":"6","key":"9532_CR25","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. Journal of Political Economy, 119(6), 1061\u20131103.","journal-title":"Journal of Political Economy"},{"issue":"4","key":"9532_CR26","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","volume":"50","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., & Kyropoulou, M. (2012). The efficiency of fair division. Theory of Computing Systems, 50(4), 589\u2013610.","journal-title":"Theory of Computing Systems"},{"key":"9532_CR27","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.\u00a0D., Shah, N., & Wang, J. (2016). The unreasonable fairness of maximum Nash welfare. In Proceedings of the 17th ACM conference on economics and computation (EC) (pp. 305\u2013322). ACM Press.","DOI":"10.1145\/2940716.2940726"},{"issue":"3","key":"9532_CR28","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/3355902","volume":"7","author":"I Caragiannis","year":"2019","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A. D., Shah, N., & Wang, J. (2019). The unreasonable fairness of maximum Nash welfare. ACM Transactions on Economics and Computation, 7(3), 12:1-12:32.","journal-title":"ACM Transactions on Economics and Computation"},{"key":"9532_CR29","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.\u00a0R., Garg, J., & Mehlhorn, K. (2020). EFX exists for three agents. In Proceedings of the 21st ACM conference on economics and computation (EC) (pp. 1\u201419).","DOI":"10.1145\/3391403.3399511"},{"key":"9532_CR30","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.\u00a0R., Garg, J., McGlaughlin, P., & Mehta, R. (2021). Competitive allocation of a mixed manna. In Proceedings of the 32nd annual ACM-SIAM symposium on discrete algorithms (SODA).","DOI":"10.1137\/1.9781611976465.85"},{"key":"9532_CR31","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Freeman, R., & Shah, N. (2017). Fair public decision making. In Proceedings of the 18th ACM conference on economics and computation (EC) (pp. 629\u2013646).","DOI":"10.1145\/3033274.3085125"},{"key":"9532_CR32","doi-asserted-by":"crossref","unstructured":"de Keijzer, B., Bouveret, S., Klos, T., & Zhang, Y. (2009). On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In Proceedings of the 1st international conference on algorithmic decision theory (pp. 98\u2013110).","DOI":"10.1007\/978-3-642-04428-1_9"},{"issue":"1","key":"9532_CR33","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aoms\/1177706369","volume":"30","author":"E Eisenberg","year":"1959","unstructured":"Eisenberg, E., & Gale, D. (1959). Consensus of subjective probabilities: The pari-mutuel method. The Annals of Mathematical Statistics, 30(1), 165\u2013168.","journal-title":"The Annals of Mathematical Statistics"},{"key":"9532_CR34","first-page":"45","volume":"7","author":"DK Foley","year":"1967","unstructured":"Foley, D. K. (1967). Resource allocation and the public sector. Yale Economic Essays, 7, 45\u201398.","journal-title":"Yale Economic Essays"},{"key":"9532_CR35","unstructured":"Garg, J., & McGlaughlin, P. (2020). Computing competitive equilibria with mixed manna. In Proceedings of the 19th international conference on autonomous agents and multiagent systems (AAMAS) (pp. 420\u2013428)."},{"key":"9532_CR36","doi-asserted-by":"crossref","unstructured":"Ghodsi, M., HajiAghayi, M., Seddighin, M., Seddighin, S., & Yami, H. (2018). Fair allocation of indivisible goods: Improvements and generalizations. In Proceedings of the 19th ACM Conference on Economics and Computation (EC) (pp. 539\u2013556).","DOI":"10.1145\/3219166.3219238"},{"issue":"2","key":"9532_CR37","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/3140756","volume":"65","author":"D Kurokawa","year":"2018","unstructured":"Kurokawa, D., Procaccia, A. D., & Wang, J. (2018). Fair enough: Guaranteeing approximate maximin shares. Journal of the ACM, 65(2), 8:1-8:27.","journal-title":"Journal of the ACM"},{"key":"9532_CR38","doi-asserted-by":"crossref","unstructured":"Lipton, R.\u00a0J., Markakis, E., Mossel, E., & Saberi, A. (2004). On approximately fair allocations of indivisible goods. In Proceedings of the 5th ACM conference on electronic commerce (EC) (pp. 125\u2013131).","DOI":"10.1145\/988772.988792"},{"key":"9532_CR39","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s11856-019-1939-6","volume":"234","author":"F Meunier","year":"2019","unstructured":"Meunier, F., & Zerbib, S. (2019). Envy-free cake division without assuming the players prefer nonempty pieces. Israel Journal of Mathematics, 234, 907\u2013925.","journal-title":"Israel Journal of Mathematics"},{"key":"9532_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1146\/annurev-economics-080218-025559","volume":"11","author":"H Moulin","year":"2019","unstructured":"Moulin, H. (2019). Fair division in the internet age. Annual Review of Economics, 11, 1\u201337.","journal-title":"Annual Review of Economics"},{"key":"9532_CR41","doi-asserted-by":"crossref","unstructured":"Plaut, B., & Roughgarden, T. (2018). Almost envy-freeness with general valuations. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2018 (pp. 2584\u20132603).","DOI":"10.1137\/1.9781611975031.165"},{"key":"9532_CR42","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855","volume-title":"Cake cutting algorithms: Be fair if you can","author":"JM Robertson","year":"1998","unstructured":"Robertson, J. M., & Webb, W. A. (1998). Cake cutting algorithms: Be fair if you can. A. K. Peters."},{"key":"9532_CR43","unstructured":"Segal-Halevi, E. (2018). Fairly dividing a cake after some parts were burnt in the oven. In Proceedings of the 17th international conference on autonomous agents and multiagent systems (AAMAS) (pp. 1276\u20131284)."},{"key":"9532_CR44","doi-asserted-by":"publisher","first-page":"315","DOI":"10.2307\/1907319","volume":"17","author":"H Steinhaus","year":"1949","unstructured":"Steinhaus, H. (1949). The problem of fair division. Econometrica, 17, 315\u2013319.","journal-title":"Econometrica"},{"issue":"8","key":"9532_CR45","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1080\/00029890.1980.11995109","volume":"87","author":"W Stromquist","year":"1980","unstructured":"Stromquist, W. (1980). How to cut a cake fairly. The American Mathematical Monthly, 87(8), 640\u2013644.","journal-title":"The American Mathematical Monthly"},{"issue":"10","key":"9532_CR46","doi-asserted-by":"publisher","first-page":"930","DOI":"10.2307\/2589747","volume":"106","author":"FE Su","year":"1999","unstructured":"Su, F. E. (1999). Rental harmony: Sperner\u2019s lemma in fair division. The American Mathematical Monthly, 106(10), 930\u2013942.","journal-title":"The American Mathematical Monthly"},{"issue":"1","key":"9532_CR47","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"HR Varian","year":"1974","unstructured":"Varian, H. R. (1974). Equity, envy, and efficiency. Journal of Economic Theory, 9(1), 63\u201391.","journal-title":"Journal of Economic Theory"},{"issue":"1","key":"9532_CR48","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-247X(80)90225-5","volume":"78","author":"DR Woodall","year":"1980","unstructured":"Woodall, D. R. (1980). Dividing a cake fairly. Journal of Mathematical Analysis and Applications, 78(1), 233\u2013247.","journal-title":"Journal of Mathematical Analysis and Applications"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-021-09532-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-021-09532-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-021-09532-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T18:52:08Z","timestamp":1673722328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-021-09532-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,9]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9532"],"URL":"https:\/\/doi.org\/10.1007\/s10458-021-09532-8","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,9]]},"assertion":[{"value":"11 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"3"}}