Computing moral-hazard problems using the Dantzig-Wolfe decomposition algorithm
Linear programming is an important method for computing solutions to private information problems. The method is applicable for arbitrary specifications of the references and technology. Unfortunately, as the cardinality of underlying sets increases the programs quickly become too large to compute. This paper demonstrates that moral-hazard problems have a structure that allows them to be computed using the Dantzig-Wolfe decomposition algorithm. This algorithm breaks the linear program into subproblems, greatly increasing the size of problems that may be practically computed. Connections to dynamic programming are discussed. Two examples are computed. Role of lotteries is discussed.
|Date of creation:||1998|
|Date of revision:|
|Contact details of provider:|| Web page: http://www.richmondfed.org/|
More information through EDIRC
|Order Information:|| Web: http://www.richmondfed.org/publications/ Email: |
When requesting a correction, please mention this item's handle: RePEc:fip:fedrwp:98-06. 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: (William Perkins)
If references are entirely missing, you can add them using this form.