Computing moral-hazard problems using the Dantzig-Wolfe decomposition algorithm
Edward Prescott ()
No 98-06, Working Paper from Federal Reserve Bank of Richmond
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.
Keywords: Bank supervision; Econometric models; Information theory (search for similar items in EconPapers)
References: Add references at CitEc
Citations: View citations in EconPapers (4) Track citations by RSS feed
Downloads: (external link)
http://www.richmondfed.org/publications/research/w ... /1998/pdf/wp98-6.pdf (application/pdf)
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:fip:fedrwp:98-06
Ordering information: This working paper can be ordered from
Access Statistics for this paper
More papers in Working Paper from Federal Reserve Bank of Richmond Contact information at EDIRC.
Bibliographic data for series maintained by Christian Pascasio ().