{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T05:51:21Z","timestamp":1782280281784,"version":"3.54.5"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030001100","type":"print"},{"value":"9783030001117","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00111-7_6","type":"book-chapter","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T04:32:07Z","timestamp":1535603527000},"page":"57-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items"],"prefix":"10.1007","author":[{"given":"Martin","family":"Aleksandrov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"key":"6_CR1","unstructured":"Aleksandrov, M., Aziz, H., Gaspers, S., Walsh, T.: Online fair division: analysing a food bank problem. In: Proceedings of the Twenty-Fourth IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, pp. 2540\u20132546 (2015)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-67190-1_4","volume-title":"KI 2017: Advances in Artificial Intelligence","author":"M Aleksandrov","year":"2017","unstructured":"Aleksandrov, M., Walsh, T.: Most competitive mechanisms in online fair division. In: Kern-Isberner, G., F\u00fcrnkranz, J., Thimm, M. (eds.) KI 2017. LNCS (LNAI), vol. 10505, pp. 44\u201357. Springer, Cham (2017)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Aleksandrov, M., Walsh, T.: Pure Nash equilibria in online fair division. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth IJCAI 2017, Melbourne, Australia, pp. 42\u201348 (2017)","DOI":"10.24963\/ijcai.2017\/7"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H., Bouveret, S., Caragiannis, I., Giagkousi, I., Lang, J.: Knowledge, fairness, and social constraints. In: Proceedings of the Thirty-Second AAAI 2018, New Orleans, Louisiana, USA, 2\u20137 February 2018. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11590"},{"key":"6_CR5","unstructured":"Aziz, H., Mackenzie, S., Xia, L., Ye, C.: Ex post efficiency of random assignments. In: Proceedings of the 2015 International AAMAS Conference, Istanbul, Turkey, 4\u20138 May 2015, pp. 1639\u20131640. IFAAMAS (2015)"},{"key":"6_CR6","unstructured":"Aziz, H., Rauchecker, G., Schryen, G., Walsh, T.: Algorithms for max-min share fair allocation of indivisible chores. In: Proceedings of the Thirty-First AAAI 2017, San Francisco, California, USA, 4\u20139 February 2017, pp. 335\u2013341. AAAI Press (2017)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., Farias, V.F., Trichakis, N.: The price of fairness. Operations Research 59(1), 17\u201331 (2011)","DOI":"10.1287\/opre.1100.0865"},{"key":"6_CR8","unstructured":"Bliem, B., Bredereck, R., Niedermeier, R.: Complexity of efficient and envy-free resource allocation: few agents, resources, or utility levels. In: Proceedings of the Twenty-Fifth IJCAI 2016, New York, NY, USA, 9\u201315 July 2016, pp. 102\u2013108 (2016)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. Journal of Economic Theory 100(2), 295\u2013328 (2001)","DOI":"10.1006\/jeth.2000.2710"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Bogomolnaia, A., Moulin, H., Sandomirskiy, F., Yanovskaya, E.: Dividing goods and bads under additive utilities. CoRR abs\/1610.03745 (2016)","DOI":"10.2139\/ssrn.2860002"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Borsuk, K.: Drei Stze \u00fcber die n-dimensionale euklidische Sph\u00e4re. Fundamenta Mathematicae 20(1), 177\u2013190 (1933)","DOI":"10.4064\/fm-20-1-177-190"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Cechl\u00e1rov\u00e1, K., Elkind, E., Igarashi, A., Peters, D.: Fair division of a graph. In: Proceedings of the Twenty-Sixth IJCAI 2017, 19\u201325 August 2017, pp. 135\u2013141 (2017)","DOI":"10.24963\/ijcai.2017\/20"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. Journal of AI Research (JAIR) 32, 525\u2013564 (2008)","DOI":"10.1613\/jair.2467"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Fishburn, P.C.: 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 (2000)","DOI":"10.1007\/s003550050019"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Brams, S.J., King, D.L.: Efficient fair division: help the worst off or avoid envy? Rationality and Society 17(4), 387\u2013421 (2005)","DOI":"10.1177\/1043463105058317"},{"key":"6_CR16","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.: Fair Division - From Cake-cutting to Dispute Resolution. Cambridge University Press, Cambridge (1996)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"de Clippel, G.: Equity, envy and efficiency under asymmetric information. Economics Letters 99(2), 265\u2013267 (2008)","DOI":"10.1016\/j.econlet.2007.07.022"},{"key":"6_CR18","unstructured":"Davidson, P., Evans, R.: Poverty in Australia. ACOSS (2014)"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.2307\/1909386","volume":"35","author":"G Debreu","year":"1967","unstructured":"Debreu, G.: Preference functions on measure spaces of economic agents. Econometrica 35(1), 111\u2013122 (1967)","journal-title":"Econometrica"},{"key":"6_CR20","unstructured":"Dorsch, P., Phillips, J., Crowe, C.: Poverty in Australia. ACOSS (2016)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. The American Mathematical Monthly 68(1), 1\u201317 (1961)","DOI":"10.2307\/2311357"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Hill, T.P.: Determining a fair border. The American Mathematical Monthly 90(7), 438\u2013442 (1983)","DOI":"10.1080\/00029890.1983.11971254"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Husseinov, F.: A theory of a heterogeneous divisible commodity exchange economy. Journal of Mathematical Economics 47(1), 54\u201359 (2011)","DOI":"10.1016\/j.jmateco.2010.12.001"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Kaleta, M.: Price of fairness on networked auctions. Journal of Applied Mathematics 2014, 1\u20137 (2014)","DOI":"10.1155\/2014\/860747"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-04428-1_9","volume-title":"Algorithmic Decision Theory","author":"B Keijzer de","year":"2009","unstructured":"de Keijzer, B., Bouveret, S., Klos, T., Zhang, Y.: On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS (LNAI), vol. 5783, pp. 98\u2013110. Springer, Heidelberg (2009)"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.landusepol.2013.02.004","volume":"34","author":"SEH Kokoye","year":"2013","unstructured":"Kokoye, S.E.H., Tovignan, S.D., Yabi, J.A., Yegbemey, R.N.: Econometric modeling of farm household land allocation in the municipality of Banikoara in northern Benin. Land Use Policy 34, 72\u201379 (2013)","journal-title":"Land Use Policy"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Lahaie, S., Parkes, D.C.: Fair package assignment. In: Auctions, Market Mechanisms and Their Applications, First International ICST Conference, AMMA 2009, Boston, MA, USA, 8\u20139 May 2009, Revised Selected Papers, p. 92 (2009)","DOI":"10.1007\/978-3-642-03821-1_14"},{"key":"6_CR28","unstructured":"Lumet, C., Bouveret, S., Lema\u00eetre, M.: Fair division of indivisible goods under risk. In: ECAI. Frontiers in AI and Applications, vol. 242, pp. 564\u2013569. IOS Press (2012)"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Manurangsi, P., Suksompong, W.: Computing an approximately optimal agreeable set of items. In: Proceedings of the Twenty-Sixth IJCAI 2017, Melbourne, Australia, 19\u201325 August 2017, pp. 338\u2013344 (2017)","DOI":"10.24963\/ijcai.2017\/48"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Nicosia, G., Pacifici, A., Pferschy, U.: Price of fairness for allocating a bounded resource. European Journal of Operational Research 257(3), 933\u2013943 (2017)","DOI":"10.1016\/j.ejor.2016.08.013"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Parkes, D.C., Procaccia, A.D., Shah, N.: Beyond dominant resource fairness: extensions, limitations, and indivisibilities. ACM Transactions 3(1), 1\u201322 (2015)","DOI":"10.1145\/2739040"},{"issue":"4","key":"6_CR32","doi-asserted-by":"publisher","first-page":"637","DOI":"10.2307\/1912958","volume":"40","author":"D Schmeidler","year":"1972","unstructured":"Schmeidler, D., Vind, K.: Fair net trades. Econometrica 40(4), 637\u2013642 (1972)","journal-title":"Econometrica"},{"key":"6_CR33","unstructured":"Segal-Halevi, E., Nitzan, S.: Fair cake-cutting among groups. CoRR abs\/1510.03903 (2015)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Segal-Halevi, E., Suksompong, W.: Democratic fair division of indivisible goods. In: Proceedings of the Twenty-Seventh IJCAI-ECAI 2018, Stockholm, Sweden, 13\u201319 July 2018 (2018)","DOI":"10.24963\/ijcai.2018\/67"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Smet, P.: Nurse rostering: models and algorithms for theory, practice and integration with other problems. 4OR 14(3), 327\u2013328 (2016)","DOI":"10.1007\/s10288-016-0311-5"},{"issue":"1","key":"6_CR36","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16(1), 101\u2013104 (1948)","journal-title":"Econometrica"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Stone, A.H., Tukey, J.W.: Generalized sandwich theorems. Duke Mathematical Journal 9(2), 356\u2013359 (1942)","DOI":"10.1215\/S0012-7094-42-00925-6"},{"key":"6_CR38","unstructured":"Suksompong, W.: Assigning a small agreeable set of indivisible items to multiple players. In: Proceedings of the Twenty-Fifth IJCAI 2016, New York, NY, USA, 9\u201315 July 2016, pp. 489\u2013495. IJCAI\/AAAI Press (2016)"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Suksompong, W.: Approximate maximin shares for groups of agents. Mathematical Social Sciences 92, 40\u201347 (2018)","DOI":"10.1016\/j.mathsocsci.2017.09.004"},{"key":"6_CR40","unstructured":"Todo, T., Li, R., Hu, X., Mouri, T., Iwasaki, A., Yokoo, M.: Generalizing envy-freeness toward group of agents. In: Proceedings of the Twenty-Second IJCAI 2011, Barcelona, Catalonia, Spain, 16\u201322 July 2011, pp. 386\u2013392 (2011)"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Varian, H.R.: Equity, envy, and efficiency. Journal of Economic Theory 9(1), 63\u201391 (1974)","DOI":"10.1016\/0022-0531(74)90075-1"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Vind, K.: Edgeworth-allocations in an exchange economy with many traders. International Economic Review 5(2), 165\u2013177 (1964)","DOI":"10.2307\/2525560"},{"key":"6_CR43","doi-asserted-by":"crossref","unstructured":"Weller, D.: Fair division of a measurable space. Journal of Mathematical Economics 14(1), 5\u201317 (1985)","DOI":"10.1016\/0304-4068(85)90023-0"},{"key":"6_CR44","unstructured":"Yokoo, M.: Characterization of strategy\/false-name proof combinatorial auction protocols: price-oriented, rationing-free protocol. In: Proceedings of the Eighteenth IJCAI 2003, Acapulco, Mexico, 9\u201315 August 2003, pp. 733\u2013742 (2003)"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Zhou, L.: Strictly fair allocations in large exchange economies. Journal of Economic Theory 57(1), 158\u2013175 (1992)","DOI":"10.1016\/S0022-0531(05)80046-8"}],"container-title":["Lecture Notes in Computer Science","KI 2018: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00111-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T21:33:08Z","timestamp":1661895188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00111-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030001100","9783030001117"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00111-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}