3 Review(s)

Amazingly, the complexities of voting theory can be explained and resolved with comfortable geometry. A geometry which unifies such seemingly disparate topics as manipulation, monotonicity, and even the apportionment issues of the US Supreme Court. Although directed mainly toward students and others wishing to learn about voting, experts will discover here many previously unpublished results. As an example, a new profile decomposition quickly resolves the age-old controversies of Condorcet and Borda, demonstrates that the rankings of pairwise and other methods differ because they rely on different information, casts serious doubt on the reliability of a Condorcet winner as a standard for the field, makes the famous Arrow's Theorem predictable, and simplifies the construction of examples.