Nash-implementation of the no-envy solution on symmetric domains of economies

Battal Dogan

Games and Economic Behavior, 2016, vol. 98, issue C, 165-171

Abstract: We show that a simple game form, which resembles the “Divide-and-Choose” procedure, Nash-implements the no-envy solution on domains of economies where the set of feasible allocations is symmetric (an allocation obtained from a feasible allocation by interchanging the bundles of any two agents is also feasible) and preferences are complete (each agent can compare any two bundles). Our result extends a result by Thomson (2005) and it is applicable to a wide class of models including the classical model of fair allocation, the unidimensional single-peaked model, cake division model, and allocation of indivisible objects with monetary transfers. We show that, even when the preferences exhibit consumption externalities, an extension of the no-envy solution is Nash-implementable on general domains of economies.

Keywords: No-envy; Nash-implementation; Divide-and-Transpose (search for similar items in EconPapers)
JEL-codes: C72 D63 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825616300537
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:gamebe:v:98:y:2016:i:c:p:165-171

DOI: 10.1016/j.geb.2016.06.010

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().