Group Decision and Negotiation

, Volume 11, Issue 5, pp 405–414

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

Authors

  • Richard F. Potthoff
    • Department of Political ScienceDuke University
Article

DOI: 10.1023/A:1020485018300

Cite this article as:
Potthoff, R.F. Group Decision and Negotiation (2002) 11: 405. doi:10.1023/A:1020485018300

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.

biddingenvy-freenessfair divisionhousemates problemlinear programming

Copyright information

© Kluwer Academic Publishers 2002