{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T07:14:22Z","timestamp":1765178062867,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87756-9_19","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"289-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimizing and Balancing Envy Among Agents Using Ordered Weighted Average"],"prefix":"10.1007","author":[{"given":"Parham","family":"Shams","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lie","family":"Beynier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Bouveret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Maudet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-030-30244-3_49","volume-title":"Progress in Artificial Intelligence","author":"M Aleksandrov","year":"2019","unstructured":"Aleksandrov, M., Ge, C., Walsh, T.: Fair division minimizing inequality. In: Moura Oliveira, P., Novais, P., Reis, L.P. (eds.) EPIA 2019. LNCS (LNAI), vol. 11805, pp. 593\u2013605. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30244-3_49"},{"doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., Voudouris, A.A.: Maximum nash welfare and other stories about EFX. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 24\u201330. ijcai.org, Yokohama (2020)","key":"19_CR2","DOI":"10.24963\/ijcai.2020\/4"},{"doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Markakis, V.: Comparing approximate relaxations of envy-freeness. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, pp. 42\u201348. Stockholm, Sweden (2018)","key":"19_CR3","DOI":"10.24963\/ijcai.2018\/6"},{"doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201906, pp. 31\u201340. ACM, New York (2006)","key":"19_CR4","DOI":"10.1145\/1132516.1132522"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10458-015-9287-3","volume":"30","author":"S Bouveret","year":"2015","unstructured":"Bouveret, S., Lema\u00eetre, M.: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Auton. Agents Multi-Agent Syst. 30(2), 259\u2013290 (2015). https:\/\/doi.org\/10.1007\/s10458-015-9287-3","journal-title":"Auton. Agents Multi-Agent Syst."},{"issue":"6","key":"19_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. J. Polit. Econ. 119(6), 1061\u20131103 (2011)","journal-title":"J. Polit. Econ."},{"doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of Maximum Nash Welfare. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC \u201916, pp. 305\u2013322. ACM, New York, NY, USA (2016)","key":"19_CR7","DOI":"10.1145\/2940716.2940726"},{"doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. In: Proceedings of the 21st ACM Conference on Economics and Computation, EC \u201920, pp. 1\u201319. Association for Computing Machinery, New York (2020)","key":"19_CR8","DOI":"10.1145\/3391403.3399511"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.09.005","volume":"242","author":"Y Chevaleyre","year":"2017","unstructured":"Chevaleyre, Y., Endriss, U., Maudet, N.: Distributed fair allocation of indivisible goods. Artif. Intell. 242, 1\u201322 (2017)","journal-title":"Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Goldman, J., Karp, J., Procaccia, A.D., Sandholm, T.: The computational rise and fall of fairness. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI-14), pp. 1405\u20131411. AAAI Press, Qu\u00e9bec City (2014)","key":"19_CR10","DOI":"10.1609\/aaai.v28i1.8884"},{"unstructured":"Endriss, U.: Reduction of economic inequality in combinatorial domains. In: Gini, M.L., Shehory, O., Ito, T., Jonker, C.M. (eds.) International conference on Autonomous Agents and Multi-Agent Systems, AAMAS \u201913, Saint Paul, MN, USA, 6\u201310 May 2013, pp. 175\u2013182. IFAAMAS (2013)","key":"19_CR11"},{"issue":"1","key":"19_CR12","first-page":"45","volume":"7","author":"DK Foley","year":"1967","unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale Econ. Essays 7(1), 45\u201398 (1967)","journal-title":"Yale Econ. Essays"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/2728732.2728738","volume":"13","author":"J Goldman","year":"2015","unstructured":"Goldman, J., Procaccia, A.D.: Spliddit: unleashing fair division algorithms. SIGecom Exch. 13(2), 41\u201346 (2015)","journal-title":"SIGecom Exch."},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-319-23114-3_31","volume-title":"Algorithmic Decision Theory","author":"T Heinen","year":"2015","unstructured":"Heinen, T., Nguyen, N.-T., Rothe, J.: Fairness and rank-weighted utilitarianism in resource allocation. In: Walsh, T. (ed.) ADT 2015. LNCS (LNAI), vol. 9346, pp. 521\u2013536. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23114-3_31"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.tcs.2020.07.008","volume":"841","author":"M Kyropoulou","year":"2020","unstructured":"Kyropoulou, M., Suksompong, W., Voudouris, A.A.: Almost envy-freeness in group resource allocation. Theor. Comput. Sci. 841, 110\u2013123 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/s00453-018-0434-5","volume":"81","author":"J Lesca","year":"2019","unstructured":"Lesca, J., Minoux, M., Perny, P.: The fair OWA one-to-one assignment problem: NP-Hardness and polynomial time special cases. Algorithmica 81(1), 98\u2013123 (2019)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of divisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce (EC-04), pp. 125\u2013131. ACM, New York (2004)","key":"19_CR17","DOI":"10.1145\/988772.988792"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-41575-3_21","volume-title":"Algorithmic Decision Theory","author":"TT Nguyen","year":"2013","unstructured":"Nguyen, T.T., Rothe, J.: How to decrease the degree of envy in allocations of indivisible goods. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS (LNAI), vol. 8176, pp. 271\u2013284. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41575-3_21"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0377-2217(02)00399-5","volume":"148","author":"W Ogryczak","year":"2003","unstructured":"Ogryczak, W., \u015aliwi\u0144ski, T.: On solving linear programs with the ordered weighted averaging objective. Eur. J. Oper. Res. 148, 80\u201391 (2003)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Perny, P., Spanjaard, O.: An axiomatic approach to robustness in search problems with multiple scenarios. In: Meek, C., Kj\u00e6rulff, U. (eds.) UAI \u201903, Proceedings of the 19th Conference in Uncertainty in Artificial Intelligence, Acapulco, Mexico, 7\u201310 August 2003, pp. 469\u2013476. Morgan Kaufmann (2003)","key":"19_CR20"},{"doi-asserted-by":"crossref","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201918, pp. 2584\u20132603. USA (2018)","key":"19_CR21","DOI":"10.1137\/1.9781611975031.165"},{"key":"19_CR22","doi-asserted-by":"crossref","DOI":"10.4159\/9780674042605","volume-title":"A Theory of Justice","author":"J Rawls","year":"1971","unstructured":"Rawls, J.: A Theory of Justice. Harvard University Press, Cambridge (1971)"},{"unstructured":"Schneckenburger, S., Dorn, B., Endriss, U.: The Atkinson inequality index in multiagent resource allocation. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, S\u00e3o Paulo, Brazil, pp. 272\u2013280. ACM (2017)","key":"19_CR23"},{"issue":"4","key":"19_CR24","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/0165-4896(81)90018-4","volume":"1","author":"JA Weymark","year":"1981","unstructured":"Weymark, J.A.: Generalized Gini inequality indices. Math. Soc. Sci. 1(4), 409\u2013430 (1981)","journal-title":"Math. Soc. Sci."},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/21.87068","volume":"18","author":"RR Yager","year":"1988","unstructured":"Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans. Syst. Man. Cybern. 18, 183\u2013190 (1988)","journal-title":"IEEE Trans. Syst. Man. Cybern."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:42Z","timestamp":1673647302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}