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

Arrow's axioms for social welfare functions are shown to be inconsistent when the set of alternatives is the nonnegative orthant in a multidimensional Euclidean space and preferences are assumed to be either the set of analytic classical economic preferences or the set of Euclidean spatial...

We develop a definition of equilibrium for agenda formation in general voting settings. The definition is independent of any protocol. We show that the set of equilibrium outcomes for any Pareto efficient voting rule is uniquely determined, and in fact coincides with that of the outcomes...

In this note we prove a McGarvey theorem for the family of Separable Tournaments. This family arises in the analysis of Logrolling and Vote Trading in Committees.

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