Procedurally fair implementation under complete information
Journal of Mathematical Economics, 2018, vol. 77, issue C, 25-31
We derive a necessary and a sufficient condition for Nash implementation with a procedurally fair mechanism. Our result has a nice analogue with the path-braking result of Maskin (1999), and therefore, it allows us to give a simple characterization of those choice rules that are implementable, but not in a procedurally fair way. This reveals the constraints that insisting on procedural fairness impose on the collective.
Keywords: Characterization; Implementation; Nash equilibrium; Ex ante fairness; Ex post fairness; Symmetry (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:77:y:2018:i:c:p:25-31
Access Statistics for this article
Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii
More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Dana Niculescu ().