{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T11:15:07Z","timestamp":1778670907099,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T00:00:00Z","timestamp":1565913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T00:00:00Z","timestamp":1565913600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RO 1202\/14-2"],"award-info":[{"award-number":["RO 1202\/14-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10472-019-09659-1","type":"journal-article","created":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T07:03:07Z","timestamp":1565938987000},"page":"817-832","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The price to pay for forgoing normalization in fair division of indivisible goods"],"prefix":"10.1007","volume":"88","author":[{"given":"Pascal","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nhan-Tam","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,16]]},"reference":[{"key":"9659_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 31\u201340. ACM (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"9659_CR2","unstructured":"Bouveret, S.: Fair allocation of indivisible items: Modeling, computational complexity and algorithmics. Ph.D. Thesis, Institut Sup\u00e9rieur De L\u2019A\u00e9ronautique Et De l\u2019Espace, Toulouse, France (2007)"},{"key":"9659_CR3","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Chevaleyre, Y., Maudet, N.: Handbook of computational social choice, chap. 12. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) , pp 284\u2013310. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.013"},{"key":"9659_CR4","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Lema\u00eetre, M., Fargier, H., Lang, J.: Allocation of indivisible goods: A general model and some complexity results (extended abstract). In: Proceedings of the 4th international joint conference on autonomous agents and multiagent systems, pp. 1309\u20131310. ACM Press (2005)","DOI":"10.1145\/1082473.1082747"},{"key":"9659_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.: Fair division: From cake-cutting to dispute resolution. Cambridge University Press, Cambridge (1996)"},{"issue":"6","key":"9659_CR6","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E.: The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy 119(6), 1061\u20131103 (2011)","journal-title":"Journal of Political Economy"},{"key":"9659_CR7","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. In: Proceedings of the 17th ACM conference on economics and computation, pp. 305\u2013322. ACM (2016)","DOI":"10.1145\/2940716.2940726"},{"issue":"1","key":"9659_CR8","first-page":"3","volume":"30","author":"Y Chevaleyre","year":"2006","unstructured":"Chevaleyre, Y., Dunne, P., Endriss, U., Lang, J., Lema\u00eetre, M., Maudet, N., Padget, J., Phelps, S., Rodr\u00edguez-Aguilar, J., Sousa, P.: Issues in multiagent resource allocation. Informatica 30(1), 3\u201331 (2006)","journal-title":"Informatica"},{"key":"9659_CR9","unstructured":"Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Multiagent resource allocation with k-additive utility functions. In: Proceedings of the DIMACS-LAMSADE workshop on computer science and decision theory, Annales du LAMSADE, vol. 3, pp. 83\u2013100 (2004)"},{"issue":"1","key":"9659_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10479-008-0335-0","volume":"163","author":"Y Chevaleyre","year":"2008","unstructured":"Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Multiagent resource allocation in k-additive domains: Preference representation and complexity. Ann. Oper. Res. 163(1), 49\u201362 (2008)","journal-title":"Ann. Oper. Res."},{"key":"9659_CR11","unstructured":"Chevaleyre, Y., Endriss, U., Maudet, N.: Allocating goods on a graph to eliminate envy. In: Proceedings of the 22nd AAAI conference on artificial intelligence, pp. 700\u2013705. AAAI Press (2007)"},{"issue":"2","key":"9659_CR12","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s10458-009-9088-7","volume":"20","author":"Y Chevaleyre","year":"2010","unstructured":"Chevaleyre, Y., Endriss, U., Maudet, N.: Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality. Auton. Agent. Multi-Agent Syst. 20(2), 234\u2013259 (2010)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"9659_CR13","doi-asserted-by":"crossref","unstructured":"Cole, R., Devanur, N., Gkatzelis, V., Jain, K., Mai, T., Vazirani, V., Yazdanbod, S.: Convex program duality, fisher markets, and Nash social welfare. In: Proceedings of the 18th ACM conference on economics and computation, pp. 459\u2013460. ACM (2017)","DOI":"10.1145\/3033274.3085109"},{"key":"9659_CR14","unstructured":"Damamme, A., Beynier, A., Chevaleyre, Y., Maudet, N.: The power of swap deals in distributed resource allocation. In: Proceedings of the 14th international conference on autonomous agents and multiagent systems, pp. 625\u2013633. IFAAMAS (2015)"},{"issue":"1\u20132","key":"9659_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.artint.2005.01.006","volume":"164","author":"P Dunne","year":"2005","unstructured":"Dunne, P., Wooldridge, M., Laurence, M.: The complexity of contract negotiation. Artif. Intell. 164(1\u20132), 23\u201346 (2005)","journal-title":"Artif. Intell."},{"key":"9659_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1613\/jair.1870","volume":"25","author":"U Endriss","year":"2006","unstructured":"Endriss, U., Maudet, N., Sadri, F., Toni, F.: Negotiating socially optimal allocations of resources. J. Artif. Intell. Res. 25, 315\u2013348 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"9659_CR17","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H Freeman and Company (1979)"},{"key":"9659_CR18","unstructured":"Golovin, D.: Max-min fair allocation of indivisible goods. Tech. Rep. CMU-CS-05-144, School of Computer Science Carnegie Mellon University (2005)"},{"key":"9659_CR19","doi-asserted-by":"crossref","unstructured":"Heinen, T., Nguyen, N., Rothe, J.: Fairness and rank-weighted utilitarianism in resource allocation. In: Proceedings of the 4th international conference on algorithmic decision theory, pp. 521\u2013536. Springer-Verlag Lecture Notes in Artificial Intelligence #9346 (2015)","DOI":"10.1007\/978-3-319-23114-3_31"},{"issue":"3","key":"9659_CR20","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"R Irving","year":"1987","unstructured":"Irving, R., Leather, P., Gusfield, D.: An efficient algorithm for the \u201coptimal\u201d stable marriage. Journal of the ACM 34(3), 532\u2013543 (1987)","journal-title":"Journal of the ACM"},{"key":"9659_CR21","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among Combinatorial Problems. In: Miller, R., Thatcher, J. (eds.) Complexity of computer computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9659_CR22","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1613\/jair.4405","volume":"51","author":"I Kash","year":"2014","unstructured":"Kash, I., Procaccia, A., Shah, N.: No agent left behind: Dynamic fair division of multiple resources. J. Artif. Intell. Res. 51, 579\u2013603 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"9659_CR23","doi-asserted-by":"crossref","unstructured":"Lang, J., Rothe, J.: Fair division of indivisible goods. In: Rothe, J. (ed.) Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division, springer texts in business and economics, Chap. 8. Springer-Verlag (2015)","DOI":"10.1007\/978-3-662-47904-9_8"},{"key":"9659_CR24","unstructured":"Lange, P., Nguyen, N., Rothe, J.: The price to pay for forgoing normalization in fair division of indivisible goods. In: Nonarchival website proceedings of the 15th International Symposium on Artificial Intelligence and Mathematics. http:\/\/isaim2018.cs.virginia.edu\/papers\/ISAIM2018_Lange_etal.pdf (2018)"},{"key":"9659_CR25","unstructured":"Lange, P., Nguyen, N., Rothe, J.: The price to pay for forgoing normalization in fair division of indivisible goods. In: Nonarchival website proceedings of the 11th Multidisciplinary Workshop on Advances in Preference Handling. http:\/\/www.mpref-2018.preflib.org\/wp-content\/uploads\/2017\/12\/paper_10.pdf (2018)"},{"key":"9659_CR26","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM conference on electronic commerce, pp. 125\u2013131. ACM Press (2004)","DOI":"10.1145\/988772.988792"},{"issue":"2","key":"9659_CR27","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s10458-013-9224-2","volume":"28","author":"N Nguyen","year":"2014","unstructured":"Nguyen, N., Nguyen, T., Roos, M., Rothe, J.: Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Journal of Autonomous Agents and Multi-Agent Systems 28(2), 256\u2013289 (2014)","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems"},{"issue":"1\u20133","key":"9659_CR28","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10472-012-9328-4","volume":"68","author":"T Nguyen","year":"2013","unstructured":"Nguyen, T., Roos, M., Rothe, J.: A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. Ann. Math. Artif. Intell. 68(1\u20133), 65\u201390 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9659_CR29","doi-asserted-by":"crossref","unstructured":"Ramezani, S., Endriss, U.: Nash social welfare in multiagent resource allocation. In: Agent-mediated electronic commerce. Designing trading strategies and mechanisms for electronic markets, pp. 117\u2013131. Springer-Verlag Lecture Notes in Business Information Processing #79 (2010)","DOI":"10.1007\/978-3-642-15117-0_9"},{"key":"9659_CR30","unstructured":"Roos, M., Rothe, J.: Complexity of social welfare optimization in multiagent resource allocation. In: Proceedings of the 9th international conference on autonomous agents and multiagent systems, pp. 641\u2013648. IFAAMAS (2010)"},{"key":"9659_CR31","unstructured":"Sandholm, T.: Contract types for satisficing task allocation. In: Proceedings of the AAAI spring symposium: Satisficing models, pp. 23\u201325 (1998)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09659-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-019-09659-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-019-09659-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T19:23:50Z","timestamp":1664133830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-019-09659-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,16]]},"references-count":31,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["9659"],"URL":"https:\/\/doi.org\/10.1007\/s10472-019-09659-1","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,16]]},"assertion":[{"value":"16 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}