Mathwords logoMathwords

Envy-Freeness — Definition, Formula & Example

Envy-freeness is a fairness standard for dividing goods among people. A division is envy-free when no one would rather swap their share for someone else's, judged by their own preferences.

Let nn agents divide a resource, and let each agent ii have a valuation function viv_i. An allocation (X1,…,Xn)(X_1, \dots, X_n) assigns bundle XiX_i to agent ii. The allocation is envy-free if vi(Xi)≥vi(Xj)v_i(X_i) \ge v_i(X_j) for every pair of agents i,ji, j. Agent ii envies agent jj exactly when vi(Xj)>vi(Xi)v_i(X_j) > v_i(X_i).

Key Formula

vi(Xi)≥vi(Xj)for all i,j∈{1,…,n}v_i(X_i) \ge v_i(X_j) \quad \text{for all } i, j \in \{1, \dots, n\}
Where:
  • viv_i = Agent i's valuation function, which assigns a number to any bundle of goods
  • XiX_i = The bundle allocated to agent i
  • XjX_j = The bundle allocated to another agent j
  • nn = The number of agents

Worked Example

Problem: Alice and Bob divide three items: A, B, and C. Alice values them at 6, 3, and 1 points. Bob values them at 2, 4, and 4 points. Values add across items. Alice receives {A}, and Bob receives {B, C}. Is this allocation envy-free?
Step 1: Check Alice. Compare her value for her own bundle with her value for Bob's bundle.
vAlice({A})=6,vAlice({B,C})=3+1=4v_{\text{Alice}}(\{A\}) = 6, \quad v_{\text{Alice}}(\{B, C\}) = 3 + 1 = 4
Step 2: Check Bob the same way, using his own values.
vBob({B,C})=4+4=8,vBob({A})=2v_{\text{Bob}}(\{B, C\}) = 4 + 4 = 8, \quad v_{\text{Bob}}(\{A\}) = 2
Step 3: Each person values their own bundle at least as much as the other's. Both inequalities hold.
6≥4and8≥26 \ge 4 \quad \text{and} \quad 8 \ge 2
Answer: Yes, the allocation is envy-free. Neither Alice nor Bob would trade bundles. If you reverse it so Alice gets {B, C} and Bob gets {A}, Alice values her share at 4 and Bob's at 6, so she envies him.

Why It Matters

Envy-freeness is a central goal in fair division, a topic in game theory, economics, and algorithm design. It underlies methods such as cut-and-choose for cake cutting. It also guides real systems that split rent among roommates, divide inheritances, and allocate computing resources. With indivisible goods it can be impossible: if two people both want a single item, whoever does not get it envies the other. For this reason researchers study weaker versions such as envy-freeness up to one good (EF1).

Common Mistakes

Mistake: Assuming envy-free means everyone receives shares of equal value, or that everyone values the shares the same way.
Correction: Each agent judges the shares using their own valuation. In the example, Bob values his bundle at 8 while Alice values that same bundle at 4. Envy-freeness only requires that no agent prefers another's bundle to their own. It does not require equal values or agreement between agents.

Related Terms