SAVE Voters and Collective Ideals

Serial Approval Vote Election (SAVE)

A new voting system for finding consensus

Aggregating Voter Preferences (in 2D)

In this explorable, Figure 1, we look into possible ways of reasonably aggregating voter preferences.

Try it out yourself

Simulation controls reference ,,fold,,

The aggregation controls let you:

Set the number of voters and motions generated by a reset.
Reset the electorate using a Uniform or Normal distribution.
Set the active metric to one of:
- the taxicab or \(L_{1}\) metric,
- the normal Euclidean or \(L_{2}\) metric, or
- the Chebyshev or \(L_{\infty}\) metric.
Toggle the use of different weights for \(X\) and \(Y\) issues.
Set the selection control to select either a voter or a motion.
Add a new voter or motion (pre-selected for dragging).
Delete a selected voter or motion.
Add the "best" possible motion given the complete current data.
Adjust the X:Y weight ratio for the selected voter.
Toggle the display of:
- indifference curves, with or without curve gradients,
- gradients at grid points,
- gradients at motions,
- algorithmic gradient descent paths to a minimum,
- arrows between motions showing the tournament.
Pan and Zoom the display.

What IS the best possible election result?

Figure 1: The above is a random tournament generated with the initial parameters of 5 choices, with Win, Tie and Lose probabilities of 45%, 10%, and 45%, respectively.

Things to look for in this simulation ,,fold,,