The Geometry of Efficient Fair Division

Barbanel,Julius B. Introduction by-Name:Taylor,Alan D.

in Cambridge Books from Cambridge University Press

Abstract: What is the best way to divide a 'cake' and allocate the pieces among some finite collection of players? In this book, the cake is a measure space, and each player uses a countably additive, non-atomic probability measure to evaluate the size of the pieces of cake, with different players generally using different measures. The author investigates efficiency properties (is there another partition that would make everyone at least as happy, and would make at least one player happier, than the present partition?) and fairness properties (do all players think that their piece is at least as large as every other player's piece?). He focuses exclusively on abstract existence results rather than algorithms, and on the geometric objects that arise naturally in this context. By examining the shape of these objects and the relationship between them, he demonstrates results concerning the existence of efficient and fair partitions.

Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (22)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:cup:cbooks:9780521842488

Ordering information: This item can be ordered from
http://www.cambridge ... p?isbn=9780521842488

Access Statistics for this book

More books in Cambridge Books from Cambridge University Press
Bibliographic data for series maintained by Data Services ().