Abstract.
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 22 October 1997/Accepted: 19 January 1999
Rights and permissions
About this article
Cite this article
Klijn, F. An algorithm for envy-free allocations in an economy with indivisible objects and money. Soc Choice Welfare 17, 201–215 (2000). https://doi.org/10.1007/s003550050015
Issue Date:
DOI: https://doi.org/10.1007/s003550050015