Computation of Moral-Hazard Problems
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
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
When requesting a correction, please mention this item's handle: RePEc:sce:scecf5:411. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.