The objective of this paper is to design a laboratory experiment for an infinite-horizon sequential committee search model in order to test some of the implications obtained by the model in Albrecht, Anderson, and Vroman (2010) (AAV). We find that, compared with single- agent search, the search...

This paper's objectives are to design laboratory experiments of finite and infinite sequen- tial collective search models and to test some implications obtained in the model of Albrecht, Anderson and Vroman (2010) (the AAV model). We find that, compared with single-agent search, the average...

We consider the problem of sharing a divisible good, where agents prefer more to less. First, we prove that a sharing rule satisfies strategy proofness if and only if it has the quasi-constancy property: no one changes her own share by changing her announcements. Next, by constructing a system...