Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm
type: Item
instance of: scholarly article
title: Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm
zbMATH Open document ID: 1180.90188
DOI: 10.1016/S0165-1889(03)00053-8
author: Edward Simpson Prescott
publication date: 2008-10-24T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5356923
zbMATH Keywords: moral hazard
zbMATH Keywords: linear programming
zbMATH Keywords: decomposition
MaRDI profile type: Publication
cites work: The Decomposition Algorithm for Linear Programs
cites work: Partitioning mathematical programs for parallel solution
cites work: An Analysis of the Principal-Agent Problem
cites work: Q3354678
cites work: An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
cites work: Justifying the First-Order Approach to Principal-Agent Problems
cites work: Optimal coordination mechanisms in generalized principal-agent problems
cites work: Pareto Optima and Competitive Equilibria with Adverse Selection and Moral Hazard
cites work: Collective organizations versus relative performance contracts: Inequality, risk sharing, and moral hazard
cites work: The First-Order Approach to Principal-Agent Problems
cites work: Optimal contracts and competitive markets with costly state verification
full work available at URL: s0165-1889(03)00053-8
OpenAlex ID: W2163922268
published in: Journal of Economic Dynamics and Control
description: scientific article; zbMATH DE number 5356923