Divide-and-Permute

William Thomson

No 510, RCER Working Papers from University of Rochester - Center for Economic Research (RCER)

Abstract: We construct "simple" games implementing in Nash equilibria several solutions to the problem of fair division. These solutions are the no-envy solution, which selects the allocations such that no agent would prefer someone else's bundle to his own, and several variants of this solution. Components of strategies can be interpreted as allocations, consumption bundles, permutations, points in simplices of dimensionalities equal to the number of goods or to the number of agents, and integers. We also propose a simple game implementing the Pareto solution and games implementing the intersections of the Pareto solution with each of these solutions.

Keywords: Nash; implementation.; No-envy.; Divide-and-permute. (search for similar items in EconPapers)
Pages: 20 pages
Date: 2004-11
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://rcer.econ.rochester.edu/RCERPAPERS/rcer_510.pdf full text (application/pdf)
None

Related works:
Journal Article: Divide-and-permute (2005)
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:roc:rocher:510

Access Statistics for this paper

More papers in RCER Working Papers from University of Rochester - Center for Economic Research (RCER) University of Rochester, Center for Economic Research, Department of Economics, Harkness 231 Rochester, New York 14627 U.S.A.. Contact information at EDIRC.
Bibliographic data for series maintained by Richard DiSalvo ( this e-mail address is bad, please contact ).