Eric Mengus () and George Lukyanov ()
Abstract: This note explores conditions that admit recursive representation for a class of dynamic mechanism design problems. We derive a tight sufficient condition, called the common state property (CSP), which ensures that temporary incentive constraints guarantee implementability, and so allows to characterize the principal's problem recursively. The condition imposes no restrictions on agent's preferences and only concerns the properties of the evolution of private information.
Keywords: First order approach; Dynamic mechanism design
21 pages, June 9, 2016
Full text files
papers.cfm?abstract_id=2795572
Questions (including download problems) about the papers in this series should be directed to Antoine Haldemann ()
Report other problems with accessing this service to Sune Karlsson ().
RePEc:ebg:heccah:1151This page generated on 2024-09-13 22:19:53.