Two New Conditions Supporting the First-Order Approach to Multisignal Principal-Agent Problems

From MaRDI portal
Publication:3627282


DOI10.3982/ECTA6688zbMath1160.91314OpenAlexW2109269924MaRDI QIDQ3627282

John R. Conlon

Publication date: 18 May 2009

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3982/ecta6688



Related Items

An envelope approach to tournament design, Relational contracts and the first-order approach, Bidding for incentive contracts, A modified homotopy method for solving the principal-agent bilevel programming problem, Generic Property of the Partial Calmness Condition for Bilevel Programming Problems, Information space conditions for the first-order approach in agency problems, The existence of an optimal deterministic contract in moral hazard problems, A principal-agent problem with heterogeneous demand distributions for a carbon capture and storage system, A dual approach to agency problems, On the first-order approach in principal-agent models with hidden borrowing and lending, On the moral hazard problem without the first-order approach, Globally convergent homotopy method for designing piecewise linear deterministic contractual function, A general solution method for moral hazard problems, INFORMATION, RISK SHARING, AND INCENTIVES IN AGENCY PROBLEMS, Robust Contract Designs: Linear Contracts and Moral Hazard, Correlation and relative performance evaluation, The informativeness principle without the first-order approach, Moral hazard and the spanning condition without the first-order approach, Characterizing optimal wages in principal-agent problems without using the first-order approach, Participation in moral hazard problems, Bounds on the welfare loss from moral hazard with limited liability, Monotonicity of Optimal Contracts Without the First-Order Approach, Globally convergent method for designing twice spline contractual function, Effects of changes in preferences in moral hazard problems, Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming