Competitive envy-free division
type: Item
instance of: scholarly article
title: Competitive envy-free division
zbMATH Open document ID: 1088.91043
author: S-C. Sung
author: Milan Vlach
published in: Social Choice and Welfare
publication date: 2005-03-08T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 2143030
zbMATH Keywords: housemates problem
Wikidata QID: Q59567284
MaRDI profile type: Publication
full work available at URL: s00355-003-0240-z
OpenAlex ID: W2059582290
DOI: 10.1007/S00355-003-0240-Z
description: scientific article; zbMATH DE number 2143030