DP10579 Asymmetric Sequential Search under Incomplete Information
|Author(s):||Yizhaq Minchuk, Aner Sela|
|Publication Date:||May 2015|
|Keyword(s):||asymmetric information, sequential search|
|Programme Areas:||Industrial Organization|
|Link to this Page:||cepr.org/active/publications/discussion_papers/dp.php?dpno=10579|
We study a two-stage sequential search model with two agents who compete for one job. The agents arrive sequentially, each one in a different stage. The agents' abilities are private information and they are derived from heterogeneous distribution functions. In each stage the designer chooses an ability threshold. If an agent has a higher ability than the ability threshold in the stage in which he arrives, he gets the job and the search is over. We analyze the equilibrium ability thresholds imposed by the designer who wishes to maximize the ability of the agent who gets the job minus the search cost. We also investigate the ratio of the equilibrium ability thresholds as well as the optimal allocation of agents in both stages according to the agents' distributions of abilities.