Computation of Moral-Hazard Problems
Kenneth Judd () and
No 411, Computing in Economics and Finance 2005 from Society for Computational Economics
We study computational aspects of moral-hazard problems. We consider deterministic contracts as well as contracts with action and/or compensation lotteries, and formulate each case as a mathematical program with equilibrium constraints (MPEC). We investigate and compare solution properties of the MPEC approach with the linear programming (LP) approach with lotteries. We propose a hybrid procedure that combines the best features of the both. The hybrid procedure obtains a solution that is, if not globally optimal, at least as good as an LP solution. It also preserves the fast local convergence property by applying the SQP algorithm to MPECs. Numerical examples show that the hybrid procedure outperforms the LP approach in both computational time and solution quality in term of the optimal objective value
Keywords: MPEC problems; moral hazard; lottery problems (search for similar items in EconPapers)
JEL-codes: C63 (search for similar items in EconPapers)
References: Add references at CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:sce:scecf5:411
Access Statistics for this paper
More papers in Computing in Economics and Finance 2005 from Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F. Baum ().