Abstract We study dynamic matching in exchange markets with easy- and hard-to-match agents. A greedy policy, which attempts to match agents upon arrival, ignores the positive externality that waiting agents provide by facilitating future matchings. We prove that the trade-off between a “thicker” market and faster matching vanishes in large markets; the greedy policy leads to shorter waiting times and more agents matched than any other policy. We empirically confirm these findings in data from the National Kidney Registry. Greedy matching achieves as many transplants as commonly used policies (1.8% more than monthly batching) and shorter waiting times (16 days faster than monthly batching).

We develop an axiomatic theory of information acquisition that captures the idea of constant marginal costs in information production: the cost of generating two independent signals is the sum of their costs, and generating a signal with probability half costs half its original cost. Together with Blackwell monotonicity and a continuity condition, these axioms determine the cost of a signal up to a vector of parameters. These parameters have a clear economic interpretation and determine the difficulty of distinguishing states. (JEL D82, D83)

We study a generalization of the classical monopoly insurance problem under adverse selection (see Stiglitz 1977) where we allow for a random distribution of losses, possibly correlated with the agent’s risk parameter that is private information. Our model explains patterns of observed customer behavior and predicts insurance contracts most often observed in practice: these consist of menus of several deductible-premium pairs or menus of insurance with coverage limits–premium pairs. A main departure from the classical insurance literature is obtained here by endowing the agents with risk-averse preferences that can be represented by a dual utility functional (Yaari 1987). (JEL D81, D82, D86, D91, G22)