IDEAS home Printed from https://ideas.repec.org/p/lmu/muenar/19425.html

Discrete-time approximations of the Holmström-Milgrom brownian-motion model of intertemporal incentive provision

Author

Listed:
  • Hellwig, Martin F.
  • Schmidt, Klaus M.

Abstract

This paper studies the relation between discrete-time and continuous-time principalagent models. We derive the continuous-time model as a limit of discrete-time models with ever shorter periods and show that optimal incentive schemes in the discrete-time models approximate the optimal incentive scheme in the continuous model, which is linear in accounts. Under the additional assumption that the principal observes only cumulative total profits at the end and the agent can destroy profits unnoticed, an incentive scheme that is linear in total profits is shown to be approximately optimal in the discrete-time model when the length of the period is small.

Suggested Citation

  • Hellwig, Martin F. & Schmidt, Klaus M., 2002. "Discrete-time approximations of the Holmström-Milgrom brownian-motion model of intertemporal incentive provision," Munich Reprints in Economics 19425, University of Munich, Department of Economics.
    • Handle: RePEc:lmu:muenar:19425
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    Other versions of this item:

    More about this item

    JEL classification:

    • J33 - Labor and Demographic Economics - - Wages, Compensation, and Labor Costs - - - Compensation Packages; Payment Methods
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:lmu:muenar:19425. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tamilla Benkelberg (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.