Author
Listed:
- Sina Khorasani
(School of Business Administration, University of Dayton, Dayton, Ohio 45469)
- Ersin Körpeoğlu
(School of Management, University College London, London E14 5AA, United Kingdom)
- Vish V. Krishnan
(Rady School of Management, University of California San Diego, La Jolla, California 92093)
Abstract
Public, private, and not-for-profit organizations find advanced technology and product development projects challenging to manage due to the time and budget pressures, and turn to their development partners and suppliers to address their development needs. We study how dynamic development contests with enriched rank-based incentives and carefully tailored information design can help these organizations leverage their suppliers for their development projects while seeking to minimize project lead time by stimulating competition among them. We find that an organization using dynamically adjusted flexible rewards can achieve the minimum expected project lead time at a significantly lower cost than a fixed-reward policy. Importantly, the derived flexible-reward policy pays the minimum expected reward (i.e., achieves the first best). We further examine the case where the organization may not have sufficient budget to offer a reward that attains the minimum expected lead time. In this case, the organization uses the whole reward budget and supplements it with strategic information disclosure. Specifically, we derive an optimal information disclosure policy whereby any change in the state of competition is disclosed immediately with some probability that is weakly increasing over time. Our results indicate that dynamic rewards and strategic information disclosure are powerful tools to help organizations fulfill their development needs swiftly and cost effectively.
Suggested Citation
Sina Khorasani & Ersin Körpeoğlu & Vish V. Krishnan, 2024.
"Dynamic Development Contests,"
Operations Research, INFORMS, vol. 72(1), pages 43-59, January.
Handle:
RePEc:inm:oropre:v:72:y:2024:i:1:p:43-59
DOI: 10.1287/opre.2021.0420
Download full text from publisher
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:oropre:v:72:y:2024:i:1:p:43-59. 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.