published in: Journal of Economic Theory, 2010, 145(4), 1386-1407
We consider the problem of sequential search when the decision to stop searching is made by a committee. We show that a symmetric stationary equilibrium exists and is unique given that the distribution of rewards is log concave. Committee members set a lower acceptance threshold than do single-agent searchers. In addition, mean preserving spreads in the distribution of rewards may lower each member's continuation value – an impossibility in the single-agent setting. If committee members are very patient or very impatient, expected search duration is lower than it would be for a single agent, but, for intermediate levels of patience, this comparison may be reversed. Holding the fraction of votes required to stop fixed, expected search duration rises with committee size on patient committees but falls with committee size on impatient committees. Finally, we consider the effect of varying the number of votes required to stop, holding committee size constant. We show that the welfare-maximizing vote threshold increases in the rate of patience and that there is a finite bound on patience such that unanimity is welfare maximizing.
We use cookies to provide you with an optimal website experience. This includes cookies that are necessary for the operation of the site as well as cookies that are only used for anonymous statistical purposes, for comfort settings or to display personalized content. You can decide for yourself which categories you want to allow. Please note that based on your settings, you may not be able to use all of the site's functions.
Cookie settings
These necessary cookies are required to activate the core functionality of the website. An opt-out from these technologies is not available.
In order to further improve our offer and our website, we collect anonymous data for statistics and analyses. With the help of these cookies we can, for example, determine the number of visitors and the effect of certain pages on our website and optimize our content.