Maximal lotteries

A joint Politics and Economics series
Social choice and electoral systems
Social choice Mechanism design Comparative politics Comparison List (By country)
Single-winner methods Single vote - plurality methods First preference plurality (FPP) Two-round (US: Jungle primary) Partisan primary Instant-runoff UK: Alternative vote (AV) US: Ranked-choice (RCV) Condorcet methods Condorcet-IRV Round-robin voting Minimax Schulze Ranked pairs Maximal lottery Positional voting Plurality (el. IRV) Borda count (el. Baldwin) Antiplurality (el. Coombs) Cardinal voting Score voting Approval voting Majority judgment STAR voting
Proportional representation Party-list Apportionment Highest averages Largest remainders National remnant Biproportional List type Closed list Open list Panachage List-free PR Localized list Quota-remainder methods Hare STV Schulze STV CPO-STV Quota Borda Approval-based committees Thiele's method Phragmen's method Expanding approvals rule Method of equal shares Fractional social choice Direct representation Interactive representation Liquid democracy Fractional approval voting Maximal lottery Random ballot Semi-proportional representation Cumulative SNTV Limited voting
Mixed systems By results of combination Mixed-member majoritarian Mixed-member proportional By mechanism of combination Non-compensatory Parallel (superposition) Coexistence Conditional Fusion (majority bonus) Compensatory Seat linkage system UK: 'AMS' NZ: 'MMP' Vote linkage system Negative vote transfer Mixed ballot Supermixed systems Dual-member proportional Rural–urban proportional Majority jackpot By ballot type Single vote Double simultaneous vote Dual-vote
Paradoxes and pathologies Spoiler effects Spoiler effect Cloning paradox Frustrated majorities paradox Center squeeze Pathological response Perverse response Best-is-worst paradox No-show paradox Multiple districts paradox Strategic voting Lesser evil voting Exaggeration Truncation Turkey-raising Paradoxes of majority rule Tyranny of the majority Discursive dilemma Conflicting majorities paradox
Social and collective choice Impossibility theorems Arrow's theorem Majority impossibility Moulin's impossibility theorem McKelvey–Schofield chaos theorem Gibbard's theorem Positive results Median voter theorem Condorcet's jury theorem May's theorem Condorcet dominance theorems Harsanyi's utilitarian theorem
Politics portal Economics portal Mathematics portal
v t e

Maximal lotteries refers to a probabilistic voting rule. The method uses preferential ballots and returns a probability distribution (or linear combination) of candidates that a majority of voters would weakly prefer to any other.^[1]

Maximal lotteries satisfy a wide range of desirable properties: they elect the Condorcet winner with probability 1 if it exists^[1] and never elect candidates outside the Smith set.^[1] Moreover, they satisfy reinforcement,^[2] participation,^[3] and independence of clones.^[2] The probabilistic voting rule that returns all maximal lotteries is the only rule satisfying reinforcement, Condorcet-consistency, and independence of clones.^[2] The social welfare function that top-ranks maximal lotteries has been uniquely characterized using Arrow's independence of irrelevant alternatives and Pareto efficiency.^[4]

Maximal lotteries do not satisfy the standard notion of strategyproofness, as Allan Gibbard has shown that only random dictatorships can satisfy strategyproofness and ex post efficiency.^[5] Maximal lotteries are also nonmonotonic in probabilities, i.e. it is possible that the probability of an alternative decreases when a voter ranks this alternative up.^[1] However, they satisfy relative monotonicity, i.e., the probability of ${\displaystyle x}$ relative to that of ${\displaystyle y}$ does not decrease when ${\displaystyle x}$ is improved over ${\displaystyle y}$.^[6]

The support of maximal lotteries, which is known as the essential set or the bipartisan set, has been studied in detail.^{[7][8][9][10]}

Maximal lotteries were first proposed by the French mathematician and social scientist Germain Kreweras in 1965^[11] and popularized by Peter Fishburn.^[1] Since then, they have been rediscovered multiple times by economists,^[8] mathematicians,^[1][12] political scientists, philosophers,^[13] and computer scientists.^[14]

Several natural dynamics that converge to maximal lotteries have been observed in biology, physics, chemistry, and machine learning.^[15][16][17]

The input to this voting system consists of the agents' ordinal preferences over outcomes (not lotteries over alternatives), but a relation on the set of lotteries can be constructed in the following way: if ${\displaystyle p}$ and ${\displaystyle q}$ are lotteries over alternatives, ${\displaystyle p\succ q}$ if the expected value of the margin of victory of an outcome selected with distribution ${\displaystyle p}$ in a head-to-head vote against an outcome selected with distribution ${\displaystyle q}$ is positive. In other words, ${\displaystyle p\succ q}$ if it is more likely that a randomly selected voter will prefer the alternatives sampled from ${\displaystyle p}$ to the alternative sampled from ${\displaystyle q}$ than vice versa.^[4] While this relation is not necessarily transitive, it does always admit at least one maximal element.

It is possible that several such maximal lotteries exist, as a result of ties. However, the maximal lottery is unique whenever there the number of voters is odd.^[18] By the same argument, the bipartisan set is uniquely-defined by taking the support of the unique maximal lottery that solves a tournament game.^[8]

Maximal lotteries are equivalent to mixed maximin strategies (or Nash equilibria) of the symmetric zero-sum game given by the pairwise majority margins. As such, they have a natural interpretation in terms of electoral competition between two political parties^[19] and be computer in polynomial-time via [linear programming].

Suppose there are five voters who have the following preferences over three alternatives:

• 2 voters: ${\displaystyle a\succ b\succ c}$
• 2 voters: ${\displaystyle b\succ c\succ a}$
• 1 voter: ${\displaystyle c\succ a\succ b}$

The pairwise preferences of the voters can be represented in the following skew-symmetric matrix, where the entry for row ${\displaystyle x}$ and column ${\displaystyle y}$ denotes the number of voters who prefer ${\displaystyle x}$ to ${\displaystyle y}$ minus the number of voters who prefer ${\displaystyle y}$ to ${\displaystyle x}$.

${\displaystyle {\begin{matrix}{\begin{matrix}&&a\quad &b\quad &c\quad \\\end{matrix}}\\{\begin{matrix}a\\b\\c\\\end{matrix}}{\begin{pmatrix}0&1&-1\\-1&0&3\\1&-3&0\\\end{pmatrix}}\end{matrix}}}$

This matrix can be interpreted as a zero-sum game and admits a unique Nash equilibrium (or minimax strategy) ${\displaystyle p}$ where ${\displaystyle p(a)=3/5}$, ${\displaystyle p(b)=1/5}$, ${\displaystyle p(c)=1/5}$. By definition, this is also the unique maximal lottery of the preference profile above. The example was carefully chosen not to have a Condorcet winner. Many preference profiles admit a Condorcet winner, in which case the unique maximal lottery will assign probability 1 to the Condorcet winner. If the last voter in the example above swaps alternatives ${\displaystyle a}$ and ${\displaystyle c}$ in his preference relation, ${\displaystyle a}$ becomes the Condorcet winner and will be selected with probability 1.

• voting.ml (website for computing maximal lotteries)