Quick Search:

uzh logo
Browse by:

Zurich Open Repository and Archive 

Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-48761

Cole, Harold; Kübler, Felix (2012). Recursive contracts, lotteries and weakly concave pareto sets. Review of Economic Dynamics, 15 (4)(10-038):479-500.



Marcet and Marimon (1994, revised 1998) developed a recursive saddle point method which can be used to solve dynamic contracting problems that include participation, enforcement and incentive constraints. Their method uses a recursive multiplier to capture implicit prior promises to the agent(s) that were made in order to satisfy earlier instances of these constraints. As a result, their method relies on the invertibility of the derivative of the Pareto frontier and cannot be applied to problems for which this frontier is not strictly concave. In this paper we show how one can extend their method to a weakly concave Pareto frontier by expanding the state space to include the realizations of an end of period lottery over the extreme points of a flat region of the Pareto frontier. With this expansion the basic insight of Marcet and Marimon goes through - one can make the problem recursive in the Lagrangian multiplier which yields significant computational advantages over the conventional approach of using utility as the state variable. The case of a weakly concave Pareto frontier arises naturally in applications where the principal's choice set is not convex but where randomization is possible.

Item Type:Journal Article, refereed, original work
Communities & Collections:03 Faculty of Economics > Department of Banking and Finance
DDC:330 Economics
JEL Classification:C61, C63
Date:15 October 2012
Deposited On:21 Jul 2011 10:40
Last Modified:27 Nov 2013 23:47
Publisher:Elsevier, Academic Press
Series Name:PIER Working Paper
Number of Pages:30
Publisher DOI:10.1016/j.red.2012.05.001
Official URL:http://www.sciencedirect.com/science/article/pii/S1094202512000245
Citations:Web of Science®. Times Cited: 1
Google Scholar™
Scopus®. Citation Count: 1

Users (please log in): suggest update or correction for this item

Repository Staff Only: item control page