We study sequential search behavior in a generalized "secretary problem" in which a single object is to be selected from a set of n alternatives. Alternatives are inspected in a random order, one at a ...

We propose a new approach to simulate the likelihood of the sequential search model. By allowing search costs to be heterogeneous across consumers and products, we directly compute the joint ...

The search procedures available in the OPTEX procedure offer various compromises between speed and reliability in finding the optimum. In general, the longer an algorithm takes to arrive at an answer, ...