An Analysis of the Principal-Agent Problem
Most analyses of the principal-agent problem assume that the principal chooses an incentive scheme to maximize expected utility subject to the agent’s utility being at a stationary point. An important paper of Mirrlees has shown that this approach is generally invalid. We present an alternative procedure. If the agent’s utility function is separable in action and reward, we show that the op-timal way of implementing an action by the agent can be found by solving a convex programming problem. We use this to characterize the optimal incentive scheme and to analyze the determinants of the seriousness of an incentive problem.
(This abstract was borrowed from another version of this item.)
When requesting a correction, please mention this item's handle: RePEc:cla:levarc:391749000000000339. 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: (David K. Levine)
If references are entirely missing, you can add them using this form.