Recursive Contracts
Albert Marcet and
Ramon Marimon
Econometrica, 2019, vol. 87, issue 5, 1589-1631
Abstract:
We obtain a recursive formulation for a general class of optimization problems with forward‐looking constraints which often arise in economic dynamic models, for example, in contracting problems with incentive constraints or in models of optimal policy. In this case, the solution does not satisfy the Bellman equation. Our approach consists of studying a recursive Lagrangian. Under standard general conditions, there is a recursive saddle‐point functional equation (analogous to a Bellman equation) that characterizes a recursive solution to the planner's problem. The recursive formulation is obtained after adding a co‐state variable μt summarizing previous commitments reflected in past Lagrange multipliers. The continuation problem is obtained with μt playing the role of weights in the objective function. Our approach is applicable to characterizing and computing solutions to a large class of dynamic contracting problems.
Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (13)
Downloads: (external link)
https://doi.org/10.3982/ECTA9902
Related works:
Working Paper: Recursive Contracts (2015) 
Working Paper: Recursive Contracts (2011) 
Working Paper: Recursive contracts (2011) 
Working Paper: Recursive Contracts (2011) 
Working Paper: Recursive Contracts (1998)
Working Paper: Recursive contracts (1998) 
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:wly:emetrp:v:87:y:2019:i:5:p:1589-1631
Ordering information: This journal article can be ordered from
https://www.economet ... ordering-back-issues
Access Statistics for this article
Econometrica is currently edited by Guido W. Imbens
More articles in Econometrica from Econometric Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().