Use of Linear Programming to Find an Envy-Free Solution Closest to the Brams–Kilgour Gap Solution for the Housemates Problem

Richard F. Potthoff ()
Additional contact information
Richard F. Potthoff: Duke University

Group Decision and Negotiation, 2002, vol. 11, issue 5, No 4, 405-414

Abstract: Abstract Although the Gap Procedure that Brams and Kilgour (2001) proposed for determining the price of each room in the housemates problem has many favorable properties, it also has one drawback: Its solution is not always envy-free. Described herein is an approach that uses linear programming to find an envy-free solution closest (in a certain sense) to the Gap solution when the latter is not envy-free. If negative prices are allowed, such a solution always exists. If not, it sometimes exists, in which case linear programming can find it by disallowing negative prices. Several examples are presented.

Keywords: bidding; envy-freeness; fair division; housemates problem; linear programming (search for similar items in EconPapers)
Date: 2002
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1023/A:1020485018300 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:grdene:v:11:y:2002:i:5:d:10.1023_a:1020485018300

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10726/PS2

DOI: 10.1023/A:1020485018300

Access Statistics for this article

Group Decision and Negotiation is currently edited by Gregory E. Kersten

More articles in Group Decision and Negotiation from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().