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

DOI10.1090/NOTI1075zbMATH Open1338.91084OpenAlexW3121700742MaRDI QIDQ2813239FDOQ2813239

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 (13)

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

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)