--- title: Envy-Free up to One Item (EF1) url: https://www.emergentmind.com/topics/envy-free-up-to-one-item-ef1-2ba6071f-af1e-4553-8379-5701629b5091 type: topic --- # Envy-Free up to One Item (EF1) Searching arXiv for recent and foundational papers on EF1 and closely related variants. Envy-free up to one item (EF1) is a relaxation of envy-freeness for allocations of indivisible items. In the standard goods model, with agents \(N\), items \(M\), and valuations \(v_i\), an allocation \(\mathbf{A}=(A_i)_{i\in N}\) is EF1 if for every pair of agents \(i,j\) with \(A_j\neq \varnothing\), there exists some item \(g\in A_j\) such that \(v_i(A_i)\ge v_i(A_j\setminus\{g\})\). EF1 is central because exact envy-freeness may fail even in trivial indivisible instances, whereas EF1 often exists and supports a large theory spanning existence, computation, efficiency loss, dynamic restoration, and extensions to chores, mixed manna, budgets, graphs, and externalities [2508.09869][2004.02554]. ## 1. Formal definition and principal variants In the standard additive setting, each agent \(i\) has \[ v_i(S)=\sum_{g\in S} v_i(g) \] for every bundle \(S\subseteq M\), and EF1 asks whether each envy relation can be neutralized by removing one item from the envied bundle. This is the canonical formulation for indivisible goods and remains the reference point for most algorithmic and welfare analyses [2508.09869]. Once items may be goods, chores, or mixed, the one-item relaxation is no longer unique. For arbitrary, possibly non-monotone utilities, a generalized EF1 condition requires that for every pair \(i,j\), either \(i\) does not envy \(j\), or there exists an item \(s\in \pi(i)\cup \pi(j)\) such that \[ u_i(\pi(i)-s)\ge u_i(\pi(j)-s). \] This “either-side deletion” is necessary when removing an item from the envied bundle need not be the correct repair operation [2006.04428]. In the goods-and-chores formulation used in neural allocation work, the same idea appears as: envy can be removed either by deleting a good from the envied bundle or by deleting a chore from the envying agent’s own bundle [2112.05436]. Budget constraints induce another variant. If items have costs \(c_j\), agents have budgets \(B_i\), and only affordable subsets of another bundle are relevant, then \(\alpha\)-EF1 requires that for every pair \(i,j\) and every affordable \(S\subseteq X_j\), there exists an item \(j\in S\) such that \[ v_i(X_i)\ge \alpha\cdot v_i(S-j). \] When \(\alpha=1\), this is the budget-feasible EF1 notion [2012.03766]. Closely related work with item sizes and a charity bundle adopts the same affordable-subbundle logic and compares agents not only to one another but also to unallocated items [2106.14446]. For mixed manna, standard EF1 is difficult to extend. An allocation \(A=(A_1,\ldots,A_n)\) is called introspective envy free up to one item (IEF) if for each agent \(i\) there exists a set \(S\subseteq [m]\) with \(|S|\le 1\) such that \[ v_i(A_i \Delta S) \geq \max_{j=1}^n v_i(A_j). \] Here the symmetric difference allows agent \(i\) either to add one item to or remove one item from its own bundle. This notion coincides with EF for indivisible chores, while for indivisible goods EF implies IEF [2509.18673]. With externalities, agents evaluate whole allocations rather than only their own bundles. One formulation defines envy via bundle swaps: agent \(i\) envies \(j\) if \(V_i(A)b>0\), the price of EF1 remains asymptotically large: for \(n\ge 4\), \[ \text{price of EF1}=\Omega(\sqrt{n}). \] Thus even a highly restricted ternary domain does not improve the asymptotic \(\Theta(\sqrt n)\) behavior known for broader classes [2508.09869]. For few agents, the picture is sharper. With two agents and additive ternary valuations, the exact price of EF1 is \[ \frac{12}{11}. \] With three agents, the paper establishes \[ 1.2 \le \text{price of EF1} \le 1.256. \] The two-agent upper bound is achieved by a modified round-robin procedure, M2RR, and the three-agent upper bound by Repeated-Max-Matching (RMM) with non-wasteful tie-breaking [2508.09869]. Optimizing welfare subject to EF1 is itself computationally difficult. In the additive goods/chores/mixed setting, maximizing utilitarian social welfare among EF1 allocations is NP-hard, even though unconstrained maximum utilitarian welfare is easy and EF1 allocations themselves are easy to find [2112.05436]. This hardness motivates approximation algorithms in restricted domains. For two utility types, there is a \(2\)-approximation for normalized utilities for any number of agents, a tight \(5/3\)-approximation for three normalized agents, and a tight \(2\)-approximation for three unnormalized agents [2509.09641]. The envy-cycle-elimination (ECE) paradigm illustrates how welfare depends on the choice of EF1 algorithm rather than only on the existence theorem. Vanilla ECE has strong utilitarian price \(n^2\) and infinite strong egalitarian price. Jointly optimizing both the selected good and the receiving agent substantially improves the strong utilitarian bound, whereas optimizing only one of these two choices does not yield comparable gains [2606.02233]. ## 4. Budgets, chores, mixed manna, and externalities Budget feasibility degrades exact EF1 guarantees but preserves approximate analogues. In the model with costs, budgets, and a charity agent for unallocated goods, a feasible allocation maximizing Nash social welfare is always \(\frac14\)-EF1 and Pareto optimal, and the \(\frac14\) factor is tight [2012.03766]. When item costs are small relative to budgets, the guarantee improves toward \(\frac12\); specifically, if \[ \kappa=\min_{i\in N,\,j\in M}\frac{B_i}{c_j}, \] then Max-NSW is \[ \left(\frac12-\frac{5}{\kappa^{1/4}}\right)\text{-EF1}, \] and this asymptotic \(\frac12\) limit is itself tight [2012.03766]. Under identical additive valuations with sizes and budgets, stronger algorithmic results are available. A polynomial-time algorithm computes a \(1/2\)-EF1 allocation in general, an exact EF1 allocation when budgets are uniform, and an exact EF1 allocation for two agents. In the large-budget regime the same algorithm achieves \((1-1/\kappa)\)-EF1, while an NSW-maximizing allocation is \((1-4\kappa^{-1/4})\)-EF1 [2106.14446]. For mixed manna, the existence of PO and EF1 allocations remains open, but there is a full existence theorem for the introspective variant: an IEF and PO allocation always exists for any mixed-manna instance [2509.18673]. This generalizes the known chores existence result because IEF coincides with EF for indivisible chores [2509.18673]. Externalities fundamentally weaken the standard benchmark. One line of work extends EF1 to additive externalities and proves that EF1 always exists for two agents, and for three agents under binary valuations with a no-chore assumption [2110.09066]. A later asymptotic result resolves the general question negatively: EF1 does not always exist with externalities, and the correct universal guarantee is EF-\(\Theta(\sqrt n)\). More precisely, every instance admits an EF-\(\sqrt n\) allocation in deterministic polynomial time, and there are binary no-chore instances requiring \(\Omega(\sqrt n)\) deletions [2601.13287]. ## 5. Algorithmic paradigms and learned allocation rules EF1 computation has developed through several distinct paradigms. Sequential picking remains a core mechanism. Standard round robin already suffices for additive valuations in the prioritized-agent model, where the allocation must be EF1 globally and additionally envy-free from prioritized agents to non-prioritized agents; placing prioritized agents before the others in each round yields the stronger property [2211.16143]. More specialized sequential algorithms include M2RR for two-agent ternary welfare guarantees and divide-and-choose-style algorithms for exact budget-feasible EF1 with two agents [2508.09869][2106.14446]. Envy-graph methods supply another major family. ECE iteratively allocates a good to an unenvied agent and eliminates any envy cycle, preserving EF1 regardless of how the next good and recipient are chosen [2606.02233]. In prioritized fair division, envy-graph update rules \(U_0,U_1,U_2,U_3\) maintain EF1 while preserving the no-envy requirement from prioritized to non-prioritized agents, leading to partial allocations with a small unallocated pool for general valuations [2211.16143]. Market and welfare-based procedures give EF1 indirectly through optimization. NSW maximization yields exact EF1 in the unconstrained indivisible-goods setting as recalled in later budget-feasible work, and approximate EF1 under budget constraints [2012.03766]. In buyer utility functions, utilitarian maximization and Pareto optimality coincide, enabling a direct greedy algorithm for EF1+PO+MSW rather than an NSW computation [2109.08461]. For ex-ante fair random allocation, Birkhoff decompositions of PS or EPS outcomes produce lotteries over recursively balanced sequential allocations, each of which is EF1 [2004.02554]. Learning-based approaches treat EF1-constrained welfare optimization as a prediction problem. EEF1-NN is a fully convolutional, U-Net-inspired architecture trained with a Lagrangian loss combining utilitarian welfare and EF1-style envy penalties. The method targets allocations that are EF1 and approximately maximum-USW, and empirically achieves \(\alpha_{EF1}^{EEF1\text{-}NN}>0.99\) and \(\beta_{SW}^{EEF1\text{-}NN}>0.99\) for several distributions when \(m\ge 40\), while being much faster at inference than solving the constrained optimization problem directly [2112.05436]. ## 6. Structural limitations, robustness, and interpretation Although EF1 is weaker than envy-freeness, it is far from fragile. For two agents with arbitrary monotonic valuations over \(m\) goods, the number of EF1 allocations is always exponential in \(m\). The tight lower bound is \[ \binom{m}{m/2} \] for even \(m\), and \[ 2\binom{m-1}{(m-1)/2} \] for odd \(m\) [2006.00178]. This contrasts sharply with EFX, for which as few as two allocations may exist [2006.00178]. At the same time, EF1 is only a pairwise notion. The information-withholding framework formalizes this by asking how many goods must be hidden globally to make an allocation envy-free. An allocation is \(\mathrm{HEF}k\) if there exists a set \(S\) of at most \(k\) goods such that for every pair \(i,h\), \[ v_i(A_i)\ge v_i(A_h\setminus S). \] Here \(\mathrm{HEF}0\) is exactly envy-freeness, while \(\mathrm{EF1}\iff \mathrm{HEF}n\). Deciding whether a \(\mathrm{HEF}k\) allocation exists is NP-complete for every fixed \(k\), even for identical valuations [1907.02583]. Connectivity requirements create additional structural obstructions. In graph fair division with connected bundles, cutsets of gap \(r\ge 2\) and suitable valence block connected EF1 guarantees for specific agent counts; if a graph guarantees connected EF1 for \(n\) agents under common additive or common monotone valuations, then it contains no cutset in the corresponding forbidden interval [2402.05884]. Yet cutset-freeness is not sufficient: the paper gives an eight-vertex graph with no cutsets of gap at least \(2\) that still fails to guarantee connected EF1 for three agents under common additive valuations [2402.05884]. Finally, EF1 is not automatically the right fairness metric outside resource-allocation settings. In personalized recommendation, a position paper argues that envy and EF-1 often track preference mismatch rather than unfair treatment: a recommendation system can be envy-free and still unfair, or highly envious and yet equalize user utility. The critique is directed especially at consumer-side personalization, where heterogeneous preferences are definitional rather than pathological [2509.09037]. This suggests that EF1 is best interpreted as a fairness criterion for rival or allocative environments, not as a universal proxy for fairness across all personalized decision systems [2509.09037]. Source: https://www.emergentmind.com/topics/envy-free-up-to-one-item-ef1-2ba6071f-af1e-4553-8379-5701629b5091