We characterize the preference domains on which the Borda count satisfies Arrow’s “independence of irrelevant alternatives” condition. Under a weak richness condition, these domains are obtained by fixing one preference ordering and including all its cyclic permutations (“Condorcet...

In a framework with two parties, deterministic voter preferences and a type of geographical constraints, we propose a set of simple axioms and show that they jointly characterize the districting rule that maximizes the number of districts one party can win, given the distribution of individual...

We study the districting problem from an axiomatic point of view in a framework with two parties, deterministic voter preferences and geographical constraints. The axioms are normatively motivated and reflect a notion of fairness to voters. Our main result is an “impossibility” theorem...

We show that optimal partisan redistricting with geographical constraints is a computationally intractable (NP-complete) problem. In particular, even when voter's preferences are deterministic, a solution is generally not obtained by concentrating opponent's supporters in "unwinnable" districts...

We characterize the preference domains on which the Borda count satisfies Maskin monotonicity. The basic concept is the notion of a "cyclic permutation domain" which arises by fixing one particular ordering of alternatives and including all its cyclic permutations. The cyclic permutation domains...

In a framework with two parties, deterministic voter preferences and a type of geographical constraints, we propose a set of simple axioms and show that they jointly characterize the districting rule that maximizes the number of districts one party can win, given the distribution of individual...