Maximal Lotteries
ⓘ
×
Maximal lotteries is an attractive randomized voting rule, first considered by Germaine Kreweras in 1965 and independently proposed by Peter C. Fishburn in 1984.
Please see
Wikipedia
, these presentations (
Practical Voting Rules
,
Maximal Lotteries
), or
this bibliography
for more information.
This website is provided by the
Chair of Decision Sciences & Systems
at
Technical University of Munich
. Contributors:
Florian Brandl
,
Felix Brandt
(responsible),
René Romen
,
Alexander Schlenga
(currently in charge), Dominik Spies, Christian Stricker.
For questions or feedback, please contact us at
voting@dss.in.tum.de
.
×
Key
Command
p
Show / Hide the
p
reference profile
r
R
andomize the preference profile (Impartial Culture)
c
Randomize without
C
ondorcet winner
m
Show / Hide majority
m
atrix
w
Randomize
w
eights of majority matrix
e
Enter / Leave
e
dit mode of the majority matrix
o
Compute an
o
ptimal profile for the majority matrix
s
Show / Hide the
s
ettings for maximal lottery
t
Toggle the
t
ie-breaking of maximal lotteries
f
Show / Hide the additional Social Choice
F
unctions
?
Show / Hide this overview
▼
Random
Preferences of
Voters over
Alternatives
Voters:
×
A
B
C
Voters:
×
C
A
B
Voters:
×
B
C
A
+
▶
Majority Matrix
A
B
C
A
0
1
-1
B
-1
0
1
C
1
-1
0
Edit
Visualize
Reset
Double Entries
Randomize
with weights up to
The profile is minimal!
▼
Maximal Lottery
↓
Canvas not supported, use another browser.
▶
Settings
Majority Margin Exponent
0
5
1
Exponent 0 corresponds to C1-ML and
exponent 1 to C2-ML, which is the default.
Tie-Breaking:
In case of multiple maximal lotteries, return the average of extremal maximal lotteries.
Sound:
▶
Other Rules
Borda
Loading
Nanson
Loading
Baldwin
Loading
Black
Loading
MaxiMin
Loading
Tideman
Loading
Plurality
Loading
Plurality with Runoff
Loading
Instant Runoff
Loading
Anti-Plurality
Loading
Bucklin
Loading
Coombs
Loading
Young
Loading
Copeland
Loading
Uncovered Set
Loading
Essential Set
Loading
Bipartisan Set
Loading
Kemeny
Loading
Schulze
Loading
Ranked Pairs
Loading
Condorcet
Loading
Pareto
Loading
Split Cycle
Loading
Open this profile on Pref.Tools
▼
Urn process
Maximal Lottery
0
100
200
300
400
500
600
700
800
900
1,000
Round
0.0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1.0
Fraction of balls (average dashed)
Number of balls:
Mutation rate:
Speed:
Slow
Fast
Draws per round:
200
Reset urn distribution
Reset graph
Explanation of the urn process
Source on GitHub
· 2018-2025 ·
Decision Sciences & Systems
·
Technische Universität München