Envy-Freeness and Fair Division¶

Why It Matters¶

Envy-freeness provides a formal test for certain kinds of fairness without requiring interpersonal utility comparison. You can achieve envy-free division even when people value things differently. It's computationally achievable for divisible goods.

The Key Move¶

When dividing resources among parties, check: Given the final allocation, would any party prefer to swap their bundle for another's? If not, the division is envy-free. For divisible goods, use procedures that guarantee this (e.g., I-cut-you-choose for two parties).

Classic Application¶

Fair division algorithms. "I cut, you choose" for two people and divisible goods guarantees envy-freeness. Cutter makes pieces they consider equal, so won't envy chooser. Chooser picks preferred piece, so won't envy cutter.

Surprising Application¶

Task allocation in teams. Envy-free division possible even when tasks differ in desirability. Have each person bid time-commitment for each task; allocate to lowest bidder. If bids are honest, no one envies others' task bundles given their own preferences.

Failure Modes¶

• Assuming envy-freeness requires equal objective value (it only requires subjective preference satisfaction)
• Ignoring that envy-freeness doesn't guarantee efficiency (can be envy-free but wasteful)
• Attempting envy-free division of indivisible goods (often impossible without side payments)
• Treating envy-freeness as complete theory of fairness (it's only one criterion)

Go Deeper¶

Brams & Taylor, "Fair Division: From Cake-Cutting to Dispute Resolution"; Moulin, "Fair Division and Collective Welfare" for formal treatment.