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...

This paper investigates conditions under which the adverse selection principal-agent problem can be decomposed into a collection of pointwise maximization problems. The analysis uses an extension of the type assignment approach to optimal nonuniform pricing, pioneered by Goldman, Leland and...