We use the theory of abstract convexity to study adverse-selection principal-agent problems and two-sided matching problems, departing from much of the literature by not requiring quasilinear utility. We formulate and characterize a basic underlying implementation duality. We show how this...

We formulate a notion of stable outcomes in matching problems with one-sided asymmetric information. The key conceptual problem is to formulate a notion of a blocking pair that takes account of the inferences that the uninformed agent might make. We show that the set of stable outcomes is...

We formulate a notion of stable outcomes in matching problems with one-sided asymmetric information. The key conceptual problem is to formulate a notion of a blocking pair that takes account of the inferences that the uninformed agent might make from the hypothesis that the current allocation is...

We examine an Outside Option Game in which player I submits a claim for a share of a cake while player II simultaneously either makes a claim or chooses to opt out. If player II opts out, then she receives an opt-out payment while player I receives nothing. If player II opts in and if the claims...

In his work on market signaling, Spence proposed a dynamic model of a signaling market in which a buyer revises prices in light of experience and sellers choose utility-maximizing signals given these prices. Spence also suggested that subjecting the dynamic process to rare perturbations might...

This paper develops an approach to equilibrium selection in game theory based on studying the equilibriating process through which equilibrium is achieved. The differential equations derived from models of interactive learning typically have stationary states that are not isolated. Instead, Nash...