Competitive envy-free division
We are concerned with a fair division problem in which the indivisible “goods” to be distributed among a finite number of individuals have divisible “bads” associated with them. The problem is formulated and analyzed in terms of the housemates problem. We present an efficient procedure that decides whether an envy-free solution exists, and if so, finds one of them; otherwise finds a solution such that each envious housemate is assigned a room whose rent is zero. Copyright Springer-Verlag 2004
Year of publication: |
2004
|
---|---|
Authors: | Sung, Shao Chin ; Vlach, Milan |
Published in: |
Social Choice and Welfare. - Springer. - Vol. 23.2004, 1, p. 103-111
|
Publisher: |
Springer |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Competitive envy-free division
Sung, Shao Chin, (2004)
-
Competitive envy-free division
Sung, Shao Chin, (2004)
-
Deterministické modely rozvrhování výroby
Vlach, Milan, (1983)
- More ...