Minimizing and balancing envy among agents using ordered weighted average

DOI10.1007/978-3-030-87756-9_19MaRDI QIDQ2695450zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Almost envy-freeness in group resource allocation
• Fair in the eyes of others
• How to decrease the degree of envy in allocations of indivisible goods
• Fair in the Eyes of Others

Cites work

• Almost envy-freeness in group resource allocation
• Almost envy-freeness with general valuations
• Distributed fair allocation of indivisible goods
• Fairness and rank-weighted utilitarianism in resource allocation
• Generalized Gini inequality indices
• How to decrease the degree of envy in allocations of indivisible goods
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• On solving linear programs with the ordered weighted averaging objective.
• The Santa Claus problem
• The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695450)