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

Abstract In a seminal contribution Abel, Mankiw, Summers, and Zeckhauser (1989) show that from an aggregate dynamic perspective the US economy is Pareto efficient. We argue that, when applying their test, they implicitly make strong assumptions about the economy's future behavior. We show how...

We study here the topology of information on the space of probability measures over Polish spaces that was defined in Hellwig (1996). We show that under this topology, a convergent sequence of probability measures satisfying a conditional independence property converges to a measure that also...