Guarantees in Fair Division: general or monotone preferences

Anna Bogomolnaia and Herve Moulin

Papers from arXiv.org

Abstract: To divide a "manna" {\Omega} of private items (commodities, workloads, land, time intervals) between n agents, the worst case measure of fairness is the welfare guaranteed to each agent, irrespective of others' preferences. If the manna is non atomic and utilities are continuous (not necessarily monotone or convex), we can guarantee the minMax utility: that of our agent's best share in her worst partition of the manna; and implement it by Kuhn's generalisation of Divide and Choose. The larger Maxmin utility -- of her worst share in her best partition -- cannot be guaranteed, even for two agents. If for all agents more manna is better than less (or less is better than more), our Bid & Choose rules implement guarantees between minMax and Maxmin by letting agents bid for the smallest (or largest) size of a share they find acceptable.

Date: 2019-11, Revised 2020-09
New Economics Papers: this item is included in nep-des and nep-upt
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://arxiv.org/pdf/1911.10009 Latest version (application/pdf)

Related works:
Journal Article: Guarantees in Fair Division: General or Monotone Preferences (2023)
Working Paper: Guarantees in Fair Division: General or Monotone Preferences (2022)
Working Paper: Guarantees in Fair Division: General or Monotone Preferences (2022)
Working Paper: Guarantees in Fair Division: general or monotone preferences (2020)
Working Paper: Guarantees in Fair Division: general or monotone preferences (2020)
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:arx:papers:1911.10009

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators (help@arxiv.org).