In this paper a simple dynamic optimization problem is solved with the help of the recursive saddle point method developed by Marcet and Marimon (1999). According to Marcet and Marimon, their technique should yield a full characterization of the set of solutions for this problem. We show though,...

We bring together the theories of duality and dynamic programming. We show that the dual of a separable dynamic optimization problem can be recursively decomposed. We provide a dual version of the principle of optimality and give conditions under which the dual Bellman operator is a contraction...

We analyze a model in which voters learn over time their preferences regarding an irreversible social decision. Voters can either implement the project in the first period, or they can postpone the decision to the second period. We analyze the effects of different majority rules. We show that...

In real-life elections, vote-counting is often imperfect. We analyze the consequences of such imperfections in plurality and runoff rule voting games. We call a strategy profile a robust equilibrium if it is an equilibrium if the probability of a miscount is positive but small.All robust...