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 study markets in which agents first make investments and are then matched into potentially productive partnerships. Equilibrium investments and the equilibrium matching will be efficient if agents can simultaneously negotiate investments and matches, but we focus on markets in which agents...

We examine the evolutionary foundations of common equilibrium refinement ideas for extensive form games, such as backward and forward induction, by examining the limiting outcome of an evolutionary process driven by stochastic learning and (rare) mutations. We show that the limiting outcome in a...

This paper presents simple su±cient conditions under which optimal bunches inadverse-selection principal-agent problems can be characterized without using optimal controltheory.