Computing envy-freeable allocations with limited subsidies

Understand

Fair division has emerged as a very hot topic in multiagent systems, and envy-freeness is among the most compelling fairness concepts.

• An allocation of indivisible items to agents is envy-free if no agent prefers the bundle of any other agent to his own in terms of value.
• As envy-freeness is rarely a feasible goal, there is a recent focus on relaxations of its definition.
• An approach in this direction is to complement allocations with payments (or subsidies) to the agents.