How to Decrease the Degree of Envy in Allocations of Indivisible Goods

DOI10.1007/978-3-642-41575-3_21zbMath1406.91224OpenAlexW252827280MaRDI QIDQ2868559

Jörg Rothe, Trung Thanh Nguyen

Publication date: 17 December 2013

Published in: Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-41575-3_21

zbMATH Keywords

fair distributionminimum envyindivisible goods allocation

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (4)

Strategyproof mechanisms for \(2\)-facility location games with minimax envy ⋮ Minimizing and balancing envy among agents using ordered weighted average ⋮ Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods ⋮ Strategyproof mechanisms for 2-facility location games with minimax envy

Uses Software

• LEDA

This page was built for publication: How to Decrease the Degree of Envy in Allocations of Indivisible Goods