Search by committee

We consider the problem of sequential search when the decision to stop is made by a committee and show that a unique symmetric stationary equilibrium exists given a log concave distribution of rewards. We compare search by committee to the corresponding single-agent problem and show that committee members are less picky and more conservative than the single agent. We show how (i) increasing committee size holding the plurality fraction constant and (ii) increasing the plurality rule affect the equilibrium acceptance threshold and expected search duration. Finally, we show that unanimity is optimal if committee members are sufficiently patient.