In this paper we show that the approximation error of the optimal policy function in the stochastic dynamic programing problem using the policies defined by the Bellman contraction method is lower than a constant (which depends on the modulus of strong concavity of the one-period return...

This paper makes three contributions: (1) A competitive revelation principle for contracting games in which several principals compete for one privately informed agent. Specifically, given any profile of incentive compatible indirect contracting mechanisms, there exists an incentive compatible...