Two-person fair division of indivisible items: an efficient envy-free algorithm

DOI10.1090/NOTI1075MaRDI QIDQ2813239zbMATH OpenOpenAlexFDO

Authors Steven J. Brams, D. Marc Kilgour, Christian Klamler

Publication date 15 June 2016

Published in Notices of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/noti1075

Mathematics Subject Classification ID

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

Cited in

(15)

• Asymptotic existence of fair divisions for groups
• Approximate maximin shares for groups of agents
• Two-person fair division of indivisible items when envy-freeness is impossible
• Almost envy-freeness in group resource allocation
• Allocating indivisible items with minimum dissatisfaction on preference graphs
• Efficient Fair Division with Minimal Sharing
• Fair Division
• The price of connectivity in fair division
• Obtaining a proportional allocation by deleting items
• Computational complexity of necessary envy-freeness
• Countering negotiation power asymmetries by using the adjusted winner algorithm
• Allocation of indivisible items with individual preference graphs
• Proportional Borda allocations
• Complexity of round-robin allocation with potentially noisy queries
• Complexity of round-robin allocation with potentially noisy queries

This page was built for publication: Two-person fair division of indivisible items: an efficient envy-free algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2813239)