Decomposable Principal-Agent Problems

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 Sibley (1984), to derive simple sufficient conditions under which such a decomposition is possible. These conditions do not preclude optimal bunching that arises because virtual surplus functions violate the single-crossing property or participation constraints bind at interior types.