The literature offers two foundations for competitive search equilibrium, a Nash approach and a market-maker approach. When each buyer visits only one seller (or each worker makes only one job application), the two approaches are equivalent. However, when each buyer visits multiple sellers, this...

The literature offers two foundations for competitive search equilibrium, a Nash approach and a market-maker approach. When each buyer visits only one seller (or each worker makes only one job application), the two approaches are equivalent. However, when each buyer visits multiple sellers, this...

The literature offers two foundations for competitive search equilibrium, a Nash approach and a market-maker approach. When each buyer visits only one seller (or each worker makes only one job application), the two approaches are equivalent. However, when each buyer visits multiple sellers, this...

We consider a labor market with search frictions in which workers make multiple applications and firms can post and commit to general mechanisms that may be conditioned both on the number of applications received and on the number of offers received by its candidate. When the contract space...

We consider a labor market with search frictions in which workers make multiple applications and firms can post and commit to general mechanisms that may be conditioned both on the number of applications received and on the number of offers received by its candidate. When the contract space...

We consider a labor market with search frictions in which workers make multiple applications and firms can post and commit to general mechanisms that may be conditioned both on the number of applications received and on the number of offers received by its candidate. When the contract space...

This paper considers competitive search equilibrium in a market for a good whose quality differs across sellers. Each seller knows the quality of the good that he or she is offering for sale, but buyers cannot observe quality directly. We thus have a "market for lemons" with competitive search...