We propose a general model of repeated elections. In each period, a challenger is chosen from the electorate to run against an incumbent politician in a majority-rule election, and the winner then selects a policy from a multidimensional policy space. Individual policy preferences are private...

We establish existence and continuity properties of equilibria in a model of dynamic elections with a discrete (countable) state space and general policies and preferences. We provide conditions under which there is a representative voter in each state, and we give characterization results in...

I establish a folk theorem for a model of repeated elections with adverse selection: when citizens are sufficiently patient, arbitrary policy paths through arbitrarily large regions of the policy space can be supported by a refinement of perfect Bayesian equilibrium. Politicians are...

We prove a lemma characterizing majority preferences over lotteries on a subset of Euclidean space. Assuming voters have quadratic von Neumann-Morgenstern utility representations, and assuming existence of a majority undominated (or "core") point, the core voter is decisive: one lottery is...

We investigate refinements of two solutions, the saddle and the weak saddle, defined by Shapley (1964) for two-player zero-sum games. Applied to weak tournaments, the first refinement, the mixed saddle, is unique and gives us a new solution, generally lying between the GETCHA and GOTCHA sets of...

The Gibbard-Satterthwaite Theorem on the manipulability of social-choice rules assumes resoluteness: there are no ties, no multi-member choice sets. Generalizations based on a familiar lottery idea allow ties but assume perfectly shared probabilistic beliefs about their resolution. We prove a...

Gibbard has shown that a social choice function is strategy-proof if and only if it is a convex combination of dictatorships and pair-wise social choice functions. I use geometric techniques to prove the corollary that every strategy-proof and sovereign social choice function is a random...

Gibbard has shown that a social choice function is strategy-proof if and only if it is a convex combination of dictatorships and pair-wise social choice functions. I use geometric techniques to prove the corollary that every strategy-proof and sovereign social choice function is a random...