EFX exists for three agents
From MaRDI portal
Cites work
- A Little Charity Guarantees Almost Envy-Freeness
- APX-hardness of maximizing Nash social welfare with indivisible items
- Almost envy-freeness with general valuations
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
- Approximating maximin share allocations
- Approximating the Nash Social Welfare with Indivisible Items
- Approximating the Nash social welfare with budget-additive valuations
- Approximation Algorithms for Computing Maximin Share Allocations
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
- Fair division with binary valuations: one rule to rule them all
- Fair enough: guaranteeing approximate maximin shares
- Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
- Nash social welfare, matrix permanent, and stable polynomials
- On fair division for indivisible items
Cited in
(10)- Fair and truthful allocations under leveled valuations
- On the existence of EFX (and Pareto-optimal) allocations for binary chores
- Fair division with subjective divisibility
- Fair division with bounded sharing: binary and non-degenerate valuations
- Fair division with prioritized agents
- Fairness under equal-sized bundles: impossibility results and approximation guarantees
- Tractable graph structures in EFX orientation
- Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods
- Weighted EF1 allocations for indivisible chores
- Differentially private fair division
This page was built for publication: EFX exists for three agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031993)
