Social Choice and Welfare

, Volume 17, Issue 2, pp 201–215 | Cite as

An algorithm for envy-free allocations in an economy with indivisible objects and money

  • Flip Klijn


This paper studies envy-free allocations for economies with indivisible objects, quasi-linear utility functions, and an amount of money. We give a polynomially bounded algorithm for finding envy-free allocations. Connectedness of envy-graphs, which are used in the algorithm, characterizes the extreme points of the polytopes of sidepayments corresponding with envy-free allocations.


Utility Function Extreme Point Indivisible Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Flip Klijn
    • 1
  1. 1.Department of Econometrics and CentER, Tilburg University, P.O. Box 90153, 5000LE Tilburg, The Netherlands (e-mail:

Personalised recommendations