A model of directed search with a finite number of buyers and sellers is considered, where sellers compete in direct mechanisms. Buyer heterogeneity and Nash equilibrium results in perfect sorting. The restriction to complementary inputs, that the match value function Q is supermodular, in addition coordinates the sellers’ strategies. In that case, equilibrium implements positive assortative matching, which is efficient and consistent with the stable (cooperative equilibrium) outcome. This provides a non-cooperative and decentralized solution for the Assignment Game. Conversely, if buyers are identical, no such coordination is possible, and there is a continuum of equilibria, one of which exhibits price posting, another yields competition in auctions.
In order to set up a list of libraries that you have access to,
you must first login
or sign up.
Then set up a personal list of libraries from your profile page by
clicking on your user name at the top right of any screen.