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...

We also explore the robustness of our model when second period valuations are correlated across individuals, and when each individual's first and second period types are correlated.

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...

We bring together the theories of duality and dynamic programming. We show that the dual of an additively separable dynamic optimization problem can be recursively decomposed using summaries of past Lagrange multipliers as state variables. Analogous to the Bellman decomposition of the primal...

In this paper we estimate the marriage market returns to being admitted to a higher ranked (i.e. more ”elite”) university by exploiting unique features of the Chilean university admission system.This system centrally allocates applicants based on their university entrance test score, which...

Several recent papers have proposed recursive Lagrangian-basedmethods for solving dynamic contracting problems. Thesemethods 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...

This paper considers the optimal mechanism design problem of an expected revenue maximizing principal who wants to sell a single unit of a good to an agent who is ambiguity averse in the sense of Gilboa and Schmeidler (1989). We show that the optimal static mechanism is an ambiguous mechanism....