IDEAS home Printed from https://ideas.repec.org/a/inm/ororsc/v33y2022i2p810-830.html
   My bibliography  Save this article

Division of Labor Through Self-Selection

Author

Listed:
  • Marlo Raveendran

    (School of Business, University of California, Riverside, California 92521)

  • Phanish Puranam

    (Strategy Department, INSEAD, Singapore 138676)

  • Massimo Warglien

    (Department of Management, Ca’Foscari University of Venice, 30121 Venice, Italy)

Abstract

Self-selection–based division of labor has gained visibility through its role in varied organizational contexts such as nonhierarchical firms, agile teams, and project-based organizations. Yet, we know relatively little about the precise conditions under which it can outperform the traditional allocation of work to workers by managers. We develop a computational agent-based model that conceives of division of labor as a matching process between workers’ skills and tasks. This allows us to examine in detail when and why different approaches to division of labor may enjoy a relative advantage. We find a specific confluence of conditions under which self-selection has an advantage over traditional staffing practices arising from matching: when employees are very skilled but at only a narrow range of tasks, the task structure is decomposable, and employee availability is unforeseeable. Absent these conditions, self-selection must rely on the benefits of enhanced motivation or better matching based on worker’s private information about skills, to dominate more traditional allocation processes. These boundary conditions are noteworthy both for those who study as well as for those who wish to implement forms of organizing based on self-selection.

Suggested Citation

  • Marlo Raveendran & Phanish Puranam & Massimo Warglien, 2022. "Division of Labor Through Self-Selection," Organization Science, INFORMS, vol. 33(2), pages 810-830, March.
  • Handle: RePEc:inm:ororsc:v:33:y:2022:i:2:p:810-830
    DOI: 10.1287/orsc.2021.1449
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/orsc.2021.1449
    Download Restriction: no

    File URL: https://libkey.io/10.1287/orsc.2021.1449?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
    ---><---

    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:ororsc:v:33:y:2022:i:2:p:810-830. 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.