IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v239y2026icp967-985.html
   My bibliography  Save this article

Optimal contract design with labor–leisure choice under limited commitment: A free boundary approach

Author

Listed:
  • An, Jongbong
  • Jeon, Junkee
  • Kim, Takwon

Abstract

We study a continuous-time optimal contracting problem involving labor–leisure choices under limited commitment. A principal offers a contract to a risk-averse agent whose wage follows a geometric Brownian motion. The agent derives utility from both consumption and leisure, modeled through a Cobb–Douglas utility function. Due to limited commitment, the agent’s participation and promised utility constraints must be satisfied throughout the contracting horizon. By employing a dual approach and dynamic programming principles, we transform the problem into a singular stochastic control problem associated with a variational inequality and a free boundary. We provide an explicit closed-form solution to the variational inequality and characterize the optimal contract in terms of consumption and leisure processes. Numerical simulations illustrate the dynamic behavior of the optimal consumption, leisure, and continuation utility processes. Our approach demonstrates the effectiveness of duality methods and singular control techniques in solving nonlinear stochastic optimization problems with state-dependent constraints, contributing to the computational aspects of optimal control and contract theory.

Suggested Citation

  • An, Jongbong & Jeon, Junkee & Kim, Takwon, 2026. "Optimal contract design with labor–leisure choice under limited commitment: A free boundary approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 239(C), pages 967-985.
  • Handle: RePEc:eee:matcom:v:239:y:2026:i:c:p:967-985
    DOI: 10.1016/j.matcom.2025.07.056
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475425003301
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2025.07.056?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    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:eee:matcom:v:239:y:2026:i:c:p:967-985. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.