Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Designing Dynamic Contests
by
Bimpikis, Kostas
, Ehsani, Shayan
, Mostagir, Mohamed
in
Competition
/ Contests
/ Crosscutting Areas
/ Disclosure of information
/ dynamic competition
/ dynamic programming/optimal control
/ Games/group decisions
/ information
/ Innovations
/ learning
/ noncooperative
/ open innovation
/ Operations research
/ Planning
/ Technological innovations
2019
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Designing Dynamic Contests
by
Bimpikis, Kostas
, Ehsani, Shayan
, Mostagir, Mohamed
in
Competition
/ Contests
/ Crosscutting Areas
/ Disclosure of information
/ dynamic competition
/ dynamic programming/optimal control
/ Games/group decisions
/ information
/ Innovations
/ learning
/ noncooperative
/ open innovation
/ Operations research
/ Planning
/ Technological innovations
2019
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Designing Dynamic Contests
by
Bimpikis, Kostas
, Ehsani, Shayan
, Mostagir, Mohamed
in
Competition
/ Contests
/ Crosscutting Areas
/ Disclosure of information
/ dynamic competition
/ dynamic programming/optimal control
/ Games/group decisions
/ information
/ Innovations
/ learning
/ noncooperative
/ open innovation
/ Operations research
/ Planning
/ Technological innovations
2019
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Designing Dynamic Contests
2019
Request Book From Autostore
and Choose the Collection Method
Overview
Firms and institutions increasingly employ
contests
as a way to innovate. Participants learn from one another’s successes and failures while competing for the contest’s awards. In “Designing Dynamic Contests,” Bimpikis, Ehsani, and Mostagir provide a number of design guidelines that focus on the contest’s information-disclosure policy. Critically, their analysis highlights that, when agents compete and learn from one another dynamically, the success of the contest largely relies on
when
and
what
information the designer chooses to disclose about their relative progress toward the end goal.
Participants race toward completing an innovation project and learn about its feasibility from their own efforts and their competitors’ gradual progress. Information about the status of competition can alleviate some of the uncertainty inherent in the contest, but it can also adversely affect effort provision from the laggards. This paper explores the problem of designing the award structure of a contest and its information disclosure policy in a dynamic framework and provides a number of guidelines for maximizing the designer’s expected payoff. In particular, we show that the probability of obtaining the innovation as well as the time it takes to complete the project are largely affected by
when
and
what
information the designer chooses to disclose. Furthermore, we establish that intermediate awards may be used by the designer to appropriately disseminate information about the status of competition. Interestingly, our proposed design matches several features observed in real-world innovation contests.
The e-companion is available at
https://doi.org/10.1287/opre.2018.1823
.
Publisher
INFORMS,Institute for Operations Research and the Management Sciences
This website uses cookies to ensure you get the best experience on our website.