Fair Allocation of Indivisible Goods

DOI10.1017/cbo9781107446984.013zbMath1448.91132OpenAlexW2499626972WikidataQ62043049 ScholiaQ62043049MaRDI QIDQ5133015

Sylvain Bouveret, Nicolas Maudet, Yann Chevaleyre

Publication date: 12 November 2020

Full work available at URL: https://doi.org/10.1017/cbo9781107446984.013

zbMATH Keywords

fair divisionindivisible goods

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (41)

Two-person fair division of indivisible items when envy-freeness is impossible ⋮ Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach ⋮ Envy-free allocations respecting social networks ⋮ Fair Packing of Independent Sets ⋮ Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness ⋮ Distributed fair allocation of indivisible goods ⋮ Almost envy-freeness for groups: improved bounds via discrepancy theory ⋮ Maximum Nash welfare and other stories about EFX ⋮ Ordinal Maximin Share Approximation for Goods ⋮ Computational aspects of assigning agents to a line ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ Parameterized complexity of envy-free resource allocation in social networks ⋮ A characterization of maximum Nash welfare for indivisible goods ⋮ Fair ride allocation on a line ⋮ Online max-min fair allocation ⋮ Computing welfare-maximizing fair allocations of indivisible goods ⋮ Fair division of goods in the shadow of market values ⋮ Approximate and strategyproof maximin share allocation of chores with ordinal preferences ⋮ Agreeable sets with matroidal constraints ⋮ Computational complexity of necessary envy-freeness ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ Allocation of indivisible items with individual preference graphs ⋮ The price to pay for forgoing normalization in fair division of indivisible goods ⋮ On fairness via picking sequences in allocation of indivisible goods ⋮ Strategy-proofness of scoring allocation correspondences for indivisible goods ⋮ Fair allocation of indivisible items with conflict graphs ⋮ Unnamed Item ⋮ The envy-free matching problem with pairwise preferences ⋮ Fair Division ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Fair allocation of indivisible goods with minimum inequality or minimum envy ⋮ Minimal envy and popular matchings ⋮ Two-player fair division of indivisible items: comparison of algorithms ⋮ Local fairness in hedonic games via individual threshold coalitions ⋮ Democratic fair allocation of indivisible goods ⋮ Optimizing social welfare in social networks ⋮ Obtaining a proportional allocation by deleting items ⋮ On the complexity of fair house allocation ⋮ Picking sequences and monotonicity in weighted fair division ⋮ Competitive Equilibrium with Indivisible Goods and Generic Budgets ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents

This page was built for publication: Fair Allocation of Indivisible Goods