Binary Election Sequences![]() Some political theorists have deprecated the capability of democracies by noting that control over the agenda and over the sequence of voting can lead to different electoral results. Arrow's impossibility theorem and considerable derivative work addresses this issue. This Demonstration helps see the circumstances under which these theoretical problems are likely to arise. As users will note, although it certainly does occur, it is somewhat unusual for the voting sequence to end up affecting the ultimate result. Although the Demonstration shows only binary elections, the underlying code works on elections in which more choices are available and in which only the winning choice survives until the next round. Sometimes, one or both of the choices in an election will no longer be available due to prior elimination. In that instance, the election is essentially "skipped" and the preference structure remains unchanged. ![]() "Binary Election Sequences" from The Wolfram Demonstrations Project http://demonstrations.wolfram.com/BinaryElectionSequences/ Contributed by: Seth J. Chandler |
![]() | ||
|
|
||















Browse all topics















