IDEAS home Printed from https://ideas.repec.org/a/spr/finsto/v29y2025i1d10.1007_s00780-024-00548-y.html
   My bibliography  Save this article

Gaussian agency problems with memory and linear contracts

Author

Listed:
  • Eduardo Abi Jaber

    (Ecole Polytechnique Paris)

  • Stéphane Villeneuve

    (Université Toulouse 1 Capitole (TSE-TSM-R))

Abstract

Can a principal still offer optimal dynamic contracts that are linear in end-of-period outcomes when the agent controls a process that exhibits memory? We provide a positive answer by considering a general Gaussian setting where the output dynamics are not necessarily semimartingales or Markov processes. We introduce a rich class of principal–agent models that encompasses dynamic agency models with memory. From a mathematical point of view, we show how contracting problems with Gaussian Volterra outcomes can be transformed into those of semimartingale outcomes by some change of variables to use the martingale optimality principle. Our main contribution is to show that for one-dimensional models, this setting always allows optimal linear contracts in end-of-period observable outcomes with a deterministic optimal level of effort. In higher dimensions, we show that linear contracts are still optimal when the effort cost function is radial, and we quantify the gap between linear contracts and optimal contracts for more general quadratic costs of efforts.

Suggested Citation

  • Eduardo Abi Jaber & Stéphane Villeneuve, 2025. "Gaussian agency problems with memory and linear contracts," Finance and Stochastics, Springer, vol. 29(1), pages 143-176, January.
  • Handle: RePEc:spr:finsto:v:29:y:2025:i:1:d:10.1007_s00780-024-00548-y
    DOI: 10.1007/s00780-024-00548-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00780-024-00548-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00780-024-00548-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Keywords

    Principal–agent models; Continuous-time control problems;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games

    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:spr:finsto:v:29:y:2025:i:1:d:10.1007_s00780-024-00548-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.