Fair Enough
From MaRDI portal
Publication:4561494
DOI10.1145/3140756zbMath1410.91314OpenAlexW2787109037MaRDI QIDQ4561494
David Kurokawa, Ariel D. Procaccia, Junxing Wang
Publication date: 6 December 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3140756
Related Items (41)
Approximation Algorithms for Computing Maximin Share Allocations ⋮ Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness ⋮ A tight negative example for MMS fair allocations ⋮ Approximating Nash social welfare under binary XOS and binary subadditive valuations ⋮ Three Persons, Two Cuts: A New Cake-Cutting Algorithm ⋮ Maximum Nash welfare and other stories about EFX ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ Ordinal Maximin Share Approximation for Goods ⋮ Approximate competitive equilibrium with generic budget ⋮ Two birds with one stone: fairness and welfare via transfers ⋮ Efficient Fair Division with Minimal Sharing ⋮ The fair division of hereditary set systems ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ Existence of EFX for two additive valuations ⋮ Exact and approximation algorithms for PMMS under identical constraints ⋮ Keep your distance: land division with separation ⋮ Approximate and strategyproof maximin share allocation of chores with ordinal preferences ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem ⋮ Envy-free matchings in bipartite graphs and their applications to fair division ⋮ On best-of-both-worlds fair-share allocations ⋮ Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination ⋮ Fair allocation of indivisible items with conflict graphs ⋮ The price of fairness for indivisible goods ⋮ Fair Division ⋮ Fair division of mixed divisible and indivisible goods ⋮ An improved approximation algorithm for maximin shares ⋮ Fair allocation of indivisible goods with minimum inequality or minimum envy ⋮ Maximin share guarantee for goods with positive externalities ⋮ Approximate maximin shares for groups of agents ⋮ Proportional Borda allocations ⋮ Democratic fair allocation of indivisible goods ⋮ A Little Charity Guarantees Almost Envy-Freeness ⋮ Fair Allocation of Indivisible Goods: Improvement ⋮ Picking sequences and monotonicity in weighted fair division ⋮ Fairly Allocating Many Goods with Few Queries ⋮ Competitive Equilibrium with Indivisible Goods and Generic Budgets ⋮ Almost envy-free allocations with connected bundles ⋮ Mind the gap: cake cutting with separation ⋮ The Price of Connectivity in Fair Division ⋮ Pipeline Interventions
This page was built for publication: Fair Enough
