Contractive Dual Methods for Incentive Problems

Several recent papers have proposed recursive Lagrangian-based methods for solving dynamic contracting problems. These methods give rise to Bellman operators that incorporate either a dual inf-sup or a saddle point operation. We give conditions that ensure the Bellman operator implied by a dual recursive formulation is contractive.