Many separable dynamic incentive problems have primal recursive formulations in which utility promises serve as state variables. We associate families of dual recursive problems with these by selectively dualizing constraints. We make transparent the connections between recursive primal and dual approaches, relate value iteration under each and give conditions for it to be convergent to the true value function.
Recursive methods for incentive problems
MESSNER, MATTHIAS;PAVONI, NICOLA;
2012
Abstract
Many separable dynamic incentive problems have primal recursive formulations in which utility promises serve as state variables. We associate families of dual recursive problems with these by selectively dualizing constraints. We make transparent the connections between recursive primal and dual approaches, relate value iteration under each and give conditions for it to be convergent to the true value function.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
