Suppose that n buyers each want one unit and m sellers each have one or more units of a good. Sellers post prices, and then buyers choose sellers. In symmetric equilibrium, similar sellers all post one price, and buyers randomize. Hence, more or fewer buyers may arrive than a seller can...

The authors study banking using the tools of mechanism design, without a priori assumptions about what banks are, who they are, or what they do. Given preferences, technologies, and certain frictions - including limited commitment and imperfect monitoring - they describe the set of incentive...

The simple search-theoretic model of fiat money has three symmetric Nash equilibria: all agents accept money with probability 1; all agents accept money with probability 0; and all agents accept money with probability y between 0 and 1. Here the author constructs a nonsymmetric pure strategy...

We analyze models where agents search for partners to form relationships (employment, marriage, etc.), and may or may not continue searching for different partners while matched. Matched agents are less inclined to search if their match yields more utility, and also if it is more stable. If one...