Minimizing and balancing envy among agents using ordered weighted average

DOI10.1007/978-3-030-87756-9_19OpenAlexW2996337539MaRDI QIDQ2695450

Sylvain Bouveret, Nicolas Maudet, Parham Shams, Aurélie Beynier

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-87756-9_19

zbMATH Keywords

social choicefair allocationmultiagent resource allocationfair division of indivisible goods

Mathematics Subject Classification ID

Decision theory (91B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14) Matching models (91B68)

Cites Work

• Unnamed Item
• Distributed fair allocation of indivisible goods
• Generalized Gini inequality indices
• The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases
• On solving linear programs with the ordered weighted averaging objective.
• Almost envy-freeness in group resource allocation
• How to Decrease the Degree of Envy in Allocations of Indivisible Goods
• The Santa Claus problem
• Fairness and Rank-Weighted Utilitarianism in Resource Allocation
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking

This page was built for publication: Minimizing and balancing envy among agents using ordered weighted average