We consider an exchange economy in which a seller can trade an endowment of a divisible good whose quality she privately knows. Buyers compete in menus of non-exclusive contracts, so that the seller may choose to trade with several buyers. In this context, we show that an equilibrium always...

We study competing-mechanism games under exclusive competition: principals first simultaneously post mechanisms, then agents simultaneously choose to participate and communicate with at most one principal. In this setting, which is common to competing-auction and competitive-search applications,...

Many financial markets rely on a discriminatory limit-order book to balance supply and demand. We study these markets in a static model in which uninformed market makers compete in nonlinear tariffs to trade with an informed insider, as in Glosten (1994), Biais, Martimort, and Rochet (2000), and...

Consider a seller of a divisible good, facing several identical buyers. The quality of the good may be low or high, and is the seller's private information. The seller has strictly convex preferences that satisfy a single-crossing property. Buyers compete by posting arbitrary menus of contracts....

We study games in which several principals contract with several privately-informed agents. We show that enabling the principals to engage in contractible private disclosures { by sending private signals to the agents about how the mechanisms will respond to the agents' messages { can...

We study resource allocation under private information when the planner cannot prevent bilateral side trading between consumers and firms. Adverse selection and side trading severely restrict feasible trades, as each marginal quantity must be fairly priced given the consumer types who purchase...

We show that a necessary and sufficient condition for entry to be unprofitable in markets with adverse selection is that that no buyer type be willing to trade at a price above the expected unit cost of serving those types who are weakly more eager to trade than her. We provide two applications...