Brams-Taylor model of fair division for divisible and indivisible items

Alexander Rubchinsky

Mathematical Social Sciences, 2010, vol. 60, issue 1, 1-14

Abstract: In this article, the fair division problem for two participants in the presence of both divisible and indivisible items is considered. Three interrelated modifications of the notion of fair division-profitably, uniformly and equitably fair divisions-were introduced. Computationally efficient algorithm for finding all of them was designed. The algorithm includes repetitive solutions of integer knapsack-type problems as its essential steps. The necessary and sufficient conditions of the existence of proportional and equitable division were found. The statements of the article are illustrated by various examples.

Keywords: Conflict; management; Negotiation; Fairness; Knapsack; problem (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165-4896(10)00023-5
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:60:y:2010:i:1:p:1-14

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().