Competitive envy-free division (Q1767292)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2143030
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Competitive envy-free division |
scientific article; zbMATH DE number 2143030 |
Statements
Competitive envy-free division (English)
0 references
8 March 2005
0 references
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.
0 references
housemates problem
0 references
0.8523586988449097
0 references
0.8517486453056335
0 references
0.8406625986099243
0 references
0.8352341055870056
0 references
0.8314701914787292
0 references
