Searching for Breakthroughs

40 Pages Posted: 1 May 2023 Last revised: 29 Dec 2023

See all articles by Wee Chaimanowong

Wee Chaimanowong

The Chinese University of Hong Kong (CUHK)

T. Tony Ke

The Chinese University of Hong Kong (CUHK)

J. Miguel Villas-Boas

University of California, Berkeley

Date Written: April 21, 2023

Abstract

We consider a decision maker (DM) who engages in costly search for breakthroughs between two uncertain alternatives, with the option to search the alternatives sequentially or in parallel, or to stop at any time and adopt one alternative or a safe status-quo outside option. Alternatives are either good or bad, and only good ones promise breakthroughs. We show that searching the less promising alternative is always preferred under high search costs and a low outside option. Low search costs (a high outside option) prompt the DM to search the more promising alternative when she is optimistic (pessimistic). The option of searching both alternatives in parallel can also make the more promising alternative more preferred, and it can be optimal to search in parallel even when the DM’s beliefs about the two alternatives are dissimilar.

Keywords: exponential bandits, Bayesian learning, sequential search, parallel search, R&D

JEL Classification: D83, L15, M31

Suggested Citation

Chaimanowong, Wee and Ke, Tony and Villas-Boas, J. Miguel, Searching for Breakthroughs (April 21, 2023). Available at SSRN: https://ssrn.com/abstract=4425117 or http://dx.doi.org/10.2139/ssrn.4425117

Wee Chaimanowong (Contact Author)

The Chinese University of Hong Kong (CUHK) ( email )

Shatin, N.T.
Hong Kong
Hong Kong

Tony Ke

The Chinese University of Hong Kong (CUHK) ( email )

Shatin, N.T.
Hong Kong
Hong Kong

J. Miguel Villas-Boas

University of California, Berkeley ( email )

Haas School of Business
Berkeley, CA 94720
United States
510-642-1250 (Phone)
510-643-1420 (Fax)

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
200
Abstract Views
588
Rank
290,441
PlumX Metrics