Distributed fair allocation of indivisible goods

DOI10.1016/j.artint.2016.09.005zbMath1392.68415OpenAlexW2517956294WikidataQ62043020 ScholiaQ62043020MaRDI QIDQ343902

Yann Chevaleyre, Ulle Endriss, Nicolas Maudet

Publication date: 29 November 2016

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2016.09.005

zbMATH Keywords

social networksmultiagent systemsfair divisionnegotiationmultiagent resource allocation

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Agent technology and artificial intelligence (68T42)

Related Items (14)

Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach ⋮ Envy-free allocations respecting social networks ⋮ Computing envy-freeable allocations with limited subsidies ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ On fair division with binary valuations respecting social networks ⋮ Generalized binary utility functions and fair allocations ⋮ Minimizing and balancing envy among agents using ordered weighted average ⋮ Unnamed Item ⋮ The complexity of deciding reachability properties of distributed negotiation schemes ⋮ Fair allocation of indivisible goods with minimum inequality or minimum envy ⋮ Local fairness in hedonic games via individual threshold coalitions ⋮ Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity ⋮ On social envy-freeness in multi-unit markets ⋮ Fair in the Eyes of Others

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Fair-negotiation procedures
• Trade-off between equity and efficiency in a general economy with indivisible goods
• Handbook of social choice and welfare. Vol. 2
• An algorithm for envy-free allocations in an economy with indivisible objects and money
• The complexity of contract negotiation
• A simple procedure for finding equitable allocations of indivisible goods
• Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
• Computationally Manageable Combinational Auctions
• Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
• Fair Allocation of Indivisible Goods and Criteria of Justice
• Truth revelation in approximately efficient combinatorial auctions
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
• On Low-Envy Truthful Allocations
• Fair Allocation of Indivisible Goods
• Cake Cutting Algorithms

This page was built for publication: Distributed fair allocation of indivisible goods