Create your own awesome maps

Even on the go

with our free apps for iPhone, iPad and Android

Get Started

Already have an account?
Log In

Algo by Mind Map: Algo
0.0 stars - 0 reviews range from 0 to 5

Algo

Voting

"one round"

Scoring rules, Borda, m-1,m-2,...,0, Plurality, 1,0,...,0

Approval, each candidate is voted on yes/no, max number of votes wins

Condorcet, pairwise election, N(i,j) > N(j,i) [fix i, for all j] => i wins

Maximin / Simpson, worst performance in all pairwise elections, min(N(i,j)) [fix i, for all j]

Copeland, N(i,j) > N(j,i) => C(i,j) = 1, N(i,j) = N(j,i) => C(i,j) = 0.5, N(i,j) < N(j,i) => C(i,j) = 0, sum(C(i,j)) [fix i, for all j] => score

Buckling, B(i,l) is number of votes, thank rank i in top l, l(i) is min(l) with l > n/2, max(l(i)) wins

Ranked pairs, establish order based on N(i,j), starting with highest N(i,j), lock in, move to next pair

Cup, balanced bintree, one leave per candidate, heap?

Scoring Approval aka Approving Scoring, range e.g. 1-X

Kemeny, minimizes number of inconsistencies, (if i > j there shall not be no j > i == inconsistency)

Slater, minimizes number of onconsistencies, pairwise election based, as few pairwise elections as possible

"two rounds"

Pluraility with runoff, all but 2 removed after first round, votes transferred like stv, second round decides

"m-1 rounds"

Single transferable vote, lowest removed, votes transferred to next remaining

Anting

Maxmin Anting

diff. Anting