Two-agent Nash implementation with partially-honest agents: Almost Full Characterizations
Michele Lombardi
MPRA Paper from University Library of Munich, Germany
Abstract:
In a two-agent society with partially-honest agents, we extend Dutta and Sen (2009)'s results of Nash implementation to the domain of weak orders. We identify the class of Nash implementable social choice correspondences with a "gap" between necessary and sufficient conditions, both when exactly one agent is partially-honest and when both agents are partially-honest. We also show that, on the domain of linear orders, the "gap" between our conditions gets closed and they become equivalent to those devised by Dutta and Sen. New implementing mechanisms are devised. In line with earlier works, the classic condition of monotonicity is no longer required, whereas a weak version of the standard punishment condition is required even when both agents are known to be partially-honest. We derive simpler sufficient conditions that are satisfied in a wide range of applications.
Keywords: Two-agent Nash implementation; intrinsic preferences for honesty; permissive results (search for similar items in EconPapers)
JEL-codes: C72 D71 (search for similar items in EconPapers)
Date: 2010-12-22
New Economics Papers: this item is included in nep-cdm and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
https://mpra.ub.uni-muenchen.de/27834/1/MPRA_paper_27834.pdf original version (application/pdf)
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:pra:mprapa:27834
Access Statistics for this paper
More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().