Voting procedures are known to be plagued with a variety of difficulties such as strategic voting, or where a voter is rewarded with a better election outcome by not voting, or where a winning candidate can lose by receiving more support. Once we know that these problems can occur, the next...

Economic models as well as aggregation and decision problems with "holes" in the domain can be difficult to analyze because, unexpectedly, they are related to Arrow's Impossibility Theorem: embedded within the model may be "topological dictators." But, just as it is possible to remove the...

General conclusions relating pairwise tallies with positional (e.g., plurality, antiplurality (“vote-for-two”)) election outcomes were previously known only for the Borda Count. While it has been known since the eighteenth century that the Borda and Condorcet winners need not agree, it had...

Cycles, empty cores, intransitivities, and other complexities affect group decision and voting rules. Approaches that prevent these difficulties include the Nakamura number, Greenberg’s theorem, and single peaked preferences. The results derived here subsume and significantly extend these...