Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm

DOI10.1016/S0165-1889(03)00053-8MaRDI QIDQ951495zbMATH OpenOpenAlexFDO

Authors Edward Simpson Prescott

Publication date 24 October 2008

Published in Journal of Economic Dynamics and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0165-1889(03)00053-8

zbMATH Keywords

decompositionlinear programmingmoral hazard

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• The decomposition principle and algorithms for linear programming
• scientific article; zbMATH DE number 27752
• A dual characterization of incentive efficiency.
• DECOMP: an implementation of Dantzig-Wolfe decomposition for linear programming
• Repeated moral hazard and recursive Lagrangeans

Cites work

• An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
• An Analysis of the Principal-Agent Problem
• Collective organizations versus relative performance contracts: Inequality, risk sharing, and moral hazard
• scientific article; zbMATH DE number 4207455 (Why is no real title available?)
• Justifying the First-Order Approach to Principal-Agent Problems
• Optimal contracts and competitive markets with costly state verification
• Optimal coordination mechanisms in generalized principal-agent problems
• Pareto Optima and Competitive Equilibria with Adverse Selection and Moral Hazard
• Partitioning mathematical programs for parallel solution
• The Decomposition Algorithm for Linear Programs
• The First-Order Approach to Principal-Agent Problems

Cited in

(6)

• A modified homotopy method for solving the principal-agent bilevel programming problem
• Globally convergent method for designing twice spline contractual function
• Globally convergent homotopy method for designing piecewise linear deterministic contractual function
• Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
• A geometric programming approach to profit maximization
• A computational method for the maximization of long-run and short-run profit

This page was built for publication: Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951495)