IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v71y2025i2p1546-1563.html
   My bibliography  Save this article

The Algorithmic Assignment of Incentive Schemes

Author

Listed:
  • Saskia Opitz

    (Faculty of Management, Economics and Social Sciences, Department of Corporate Development, University of Cologne, 50923 Cologne, Germany; and Max Planck Institute for Research on Collective Goods, 53113 Bonn, Germany)

  • Dirk Sliwka

    (Faculty of Management, Economics and Social Sciences, Department of Corporate Development, University of Cologne, 50923 Cologne, Germany)

  • Timo Vogelsang

    (Department of Accounting, Frankfurt School of Finance & Management, 60322 Frankfurt, Germany)

  • Tom Zimmermann

    (Faculty of Management, Economics and Social Sciences, University of Cologne, 50923 Cologne, Germany)

Abstract

The assignment of individuals with different observable characteristics to different treatments is a central question in designing optimal policies. We study this question in the context of increasing workers’ performance via targeted incentives using machine learning algorithms with worker demographics, personality traits, and preferences as input. Running two large-scale experiments, we show that (i) performance can be predicted by accurately measured worker characteristics, (ii) a machine learning algorithm can detect heterogeneity in responses to different schemes, (iii) a targeted assignment of schemes to individuals increases performance significantly above the level of the single best scheme, and (iv) algorithmic assignment is more effective for workers who have a high likelihood to repeatedly interact with the employer or who provide more consistent survey answers.

Suggested Citation

  • Saskia Opitz & Dirk Sliwka & Timo Vogelsang & Tom Zimmermann, 2025. "The Algorithmic Assignment of Incentive Schemes," Management Science, INFORMS, vol. 71(2), pages 1546-1563, February.
    • Handle: RePEc:inm:ormnsc:v:71:y:2025:i:2:p:1546-1563
    DOI: 10.1287/mnsc.2022.03362
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2022.03362
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2022.03362?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
    ---><---

    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:inm:ormnsc:v:71:y:2025:i:2:p:1546-1563. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.