This article uncovers dynamic properties of the von Neumann–Morgenstern solution in weak tournaments and majoritarian games. We propose a new procedure for the construction of choice sets from weak tournaments, based on dynamic stability criteria. The idea is to analyze dynamic versions of...

We build a simple model of secession crises where a majority of voters may wish to accommodate a minority in order to prevent a secession attempt. We first show the existence of a majority voting equilibrium, where the median voter is decisive and most prefers a government’s type that 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...

Hansson (1969) sets forth four conditions satisfied by no generalized social welfare function (GSWF), a mapping from profiles of individual preferences to arbitrary social preference relations. Though transitivity is not imposed on social preferences, one of Hansson's conditions requires that...