We analyze a dynamic version of the Akerlof-Wilson "lemons" market in a competitive durable good setting. There is a fixed set of sellers with private information about the quality of their wares. The price mechanism sorts sellers of different qualities into different time periods--prices and...

The unraveling argument says that when a rm may produce dierent qualities and quality is unknown to consumers, the rm has an incentive to disclose the private information as in any pool of rms there is a best quality rm and this rm has an incentive to disclose. Recent literature has established...

We examine an oligopoly model where some consumers engage in costly non-sequential search to discover prices. There are three distinct price-dispersed equilibria characterized by low, moderate and high search intensity. The effects of an increase in the number of firms on search behaviour,...

In a horizontal product differentiation model, it is shown that a stable service pattern in scheduled transport competition only exists if consumers are sufficiently sensitive to the quality of non-scheduling service characteristics. Since this sensitivity is related to travel distance, the...

This paper presents an empirical examination of oligopoly pricing and consumer search. The theoretical model allows for sequential and non-sequential search and, using the theoretical restrictions firm and consumer behavior impose on the data, we study the empirical validity of the models. Two...

We take a dynamic perspective on insurance markets under adverse selection and study a dynamic version of the Rothschild and Stiglitz model. We investigate the nature of dynamic insurance contracts by considering both conditional and unconditional dynamic contracts. An unconditional dynamic...

We modify the paper of Stahl (1989) on sequential consumer search in an oligopoly context by relaxing the assumption that consumers obtain the first price quotation for free. When all price quotations are costly to obtain, a new equilibrium arises where consumers randomize between not searching...