Copyright © 2004 Elsevier Inc. All rights reserved.
Dynamic mechanism design with hidden income and hidden actions
Received 14 May 2003;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We develop general recursive methods to solve for optimal contracts in dynamic principal-agent environments with hidden states and hidden actions. Starting from a general mechanism with arbitrary communication, randomization, full history dependence, and without restrictions on preferences or technology, we show that the optimal contract can be implemented as a recursive direct mechanism. A curse of dimensionality which arises from the interaction of hidden income and hidden actions can be overcome by introducing utility bounds for behavior off the equilibrium path. Environments with multiple actions are implemented using multiple layers of such off-path utility bounds.
Keywords: Mechanism design; Dynamic contracts; Recursive contracts
JEL classification: C63; C73; D82







E-mail Article
Add to my Quick Links

Cited By in Scopus (3)






