Thumbnail Image
Item

Envy-Free Allocations of Indivisible Objects: An Algorithm and an Application

Klijn,F.
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.As an application, the existence result of envy-free allocations provides a proof of the total balancedness of permutation games.
Description
Pagination: 15
Date
1997
Journal Title
Journal ISSN
Volume Title
Publisher
Operations research
Collections
Tilburg University Research Output Collection
Show all metadata
Files
Thumbnail Image
751.pdf
Adobe PDF, 155.01 KB
Research Projects
Organizational Units
Journal Issue
Keywords
algorithm, welfare economics, D63 - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
Citation
Klijn, F 1997, Envy-Free Allocations of Indivisible Objects : An Algorithm and an Application. FEW Research Memorandum, vol. 751, vol. 751, Operations research, Tilburg.
URI
https://hdl.handle.net/20.500.14602/86676
License
info:eu-repo/semantics/restrictedAccess
Embedded videos