Content deleted Content added
m Task 18 (cosmetic): eval 4 templates: del empty params (2×); |
Undid revision 1231912456 by 80.181.176.212 (talk) |
||
(46 intermediate revisions by 21 users not shown) | |||
Line 1:
{{Short description|Single-winner cardinal voting system}}
{{Npov|date=October 2020}}
{{Electoral systems}}
'''Majority judgment''' ('''MJ''') is a single-winner [[voting system]] proposed in
==Voting process==
Voters grade as many of the candidates as they wish with regard to their suitability for office according to a series of grades. Balinski and Laraki suggest the options "Excellent, Very Good, Good, Acceptable, Poor, or Reject," but any scale can be used (e.g. the common [[letter grade]] scale). Voters can assign the same grade to multiple candidates.
As with all [[highest median voting rules]], the candidate with the highest [[median]] grade is declared winner. If more than one candidate has the same median grade, majority judgment breaks the tie by removing (one-by-one) any grades equal to the shared median grade from each tied candidate's column. This procedure is repeated until only one of the tied candidates is found to have the highest median grade.<ref>Balinski and Laraki, ''Majority Judgment'', pp.5 & 14</ref>
== Advantages and disadvantages ==
{{See also|Tactical voting#Majority judgment}}
Like most other [[cardinal voting]] rules, majority judgment satisfies the [[monotonicity criterion]], the [[later-no-help criterion]], and [[independence of irrelevant alternatives]].
Like any deterministic voting system (except [[Dictatorship mechanism|dictatorship]]), MJ allows for [[tactical voting]] in cases of more than three candidates, as a consequence of [[Gibbard's theorem]].
Majority judgment voting fails the [[Condorcet criterion]],
=== Participation failure ===
Unlike [[score voting]], majority judgment can have [[No show paradox|no-show paradoxes]],<ref>Felsenthal, Dan S. and Machover, Moshé, ''[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.324.1143&rep=rep1&type=pdf "The Majority Judgement voting procedure: a critical evaluation"]'', Homo oeconomicus, vol 25(3/4), pp. 319-334 (2008)</ref> situations where a candidate loses because they won "too many votes". In other words, adding votes that rank a candidate higher than their opponent can still cause this candidate to lose.
In their 2010 book, Balinski and Laraki demonstrate that the only join-consistent methods are point-summing methods, a slight generalization of [[score voting]] that includes [[positional voting]].<ref name=":2">{{Citation |last1=Balinski |first1=Michel |chapter=Majority Judgment |date=2011-01-28 |pages=295–301 |chapter-url=http://dx.doi.org/10.7551/mitpress/9780262015134.003.0001 |access-date=2024-02-08 |publisher=The MIT Press |last2=Laraki |first2=Rida|doi=10.7551/mitpress/9780262015134.003.0001 |isbn=978-0-262-01513-4 }}</ref> Specifically, their result shows the only methods satisfying the slightly stronger [[consistency criterion]] have:
<math>\sum_{\text{vote} \in \text{ballots}} f(\text{score}_\text{vote})</math>
Where <math>f</math> is a [[monotonic function]]. Moreover, any method satisfying both participation and either [[Continuous function|stepwise-continuity]] or the [[Archimedean property]]{{efn|Balinski and Laraki refer to this property as "respect for large electorates."}} is a point-summing method.<ref>{{Citation |last1=Balinski |first1=Michel |chapter=Majority Judgment |date=2011-01-28 |pages=300–301 |chapter-url=http://dx.doi.org/10.7551/mitpress/9780262015134.003.0001 |access-date=2024-02-08 |publisher=The MIT Press |last2=Laraki |first2=Rida|doi=10.7551/mitpress/9780262015134.003.0001 |isbn=978-0-262-01513-4 }}</ref>
This result is closely related to and relies on the [[Von Neumann–Morgenstern utility theorem]] and [[Harsanyi's utilitarian theorem]], two critical results in [[social choice theory]] and [[decision theory]] used to characterize the conditions for [[Rational choice theory|rational choice]].
Despite this result, Balinski and Laraki claim that participation failures would be rare in practice for majority judgment.<ref name=":2" />
=== Claimed resistance to tactical voting ===
In arguing for majority judgment, Balinski and Laraki (the system's inventors)
===
In
Here is a numerical example. Suppose there were seven ratings named "Excellent
{| class="wikitable"
|-
!<br /><br />{{Diagonal split header|Candidate|Votes}}!! 101 votes
Far-left
! 101 votes
Left
! 101 votes
Cen. left
! 50 votes
Center
!99 votes
Cen. right
!99 votes
Right
! 99 votes
Far-right
!Score
|-
|
|-
| Left|| bgcolor="forestgreen"|
|-
|
|-
| Center|| bgcolor="yellow"|
|-
|
|-
| Right|| bgcolor="orangered"|
|-
|
|}
The tie-breaking procedure of
Note that other [[highest median voting rules|highest median rules]]
{|
| align="right" |Candidate
|
{|
| width="49%" |
| width=
| width=
|}
|-
| align="right" |
|
{|
| width="101" bgcolor="darkgreen" |
| width="202" bgcolor="forestGreen" |
| width="50" bgcolor="yellowGreen" |
| width="99" bgcolor="yellow" |
|
|
|}
|-
| align="right" |
|
{|
| width="101" bgcolor="darkgreen" |
| width="151" bgcolor="forestGreen" |
| width="200" bgcolor="YellowGreen" |
| width="99" bgcolor="yellow" |
|
|}
|-
| align="right" |
|
{|
| width="50" bgcolor="darkgreen" |
| width="200" bgcolor="forestGreen" |
|
|
|}
|-
| align="right" |
|
{|
| width="99" bgcolor="darkgreen" |
| width="149" bgcolor="forestGreen" |
| width="200" bgcolor="YellowGreen" |
| width="101" bgcolor="yellow" |
|
|}
|-
| align="right" |
|
{|
| width="99" bgcolor="darkgreen" |
| width="198" bgcolor="forestGreen" |
| width="50" bgcolor="yellowGreen" |
| width="101" bgcolor="yellow" |
|
|
|}
|-
|
|
|-
|
|
{|
|
|
|
|
| Very good
|
|
|
|
|
|
|
|
|}
|}
Line 161 ⟶ 162:
{| class="wikitable"
|-
!<br /><br />City Choice !! Memphis<br />voters !! Nashville<br />voters !! Chattanooga<br />voters !! Knoxville<br />voters !! Median<br />rating
|-
| Memphis || bgcolor="green"|excellent || bgcolor="orangered"| poor || bgcolor="orangered"| poor || bgcolor="orangered"| poor || bgcolor="orangered"| poor+
Line 295 ⟶ 296:
|}
|}
Chattanooga and Knoxville now have the same number of "Poor" ratings as "Fair", "Good" and "Excellent" combined.
== Real-world examples ==
The somewhat-related [[median voting rule]] method was first explicitly proposed to assign budgets by [[Francis Galton]] in 1907.<ref>Francis Galton, "One vote, one value," Letter to the editor, ''Nature'' vol. 75, Feb. 28, 1907, p. 414.</ref> Hybrid mean/median systems based on the [[trimmed mean]] have long been used to assign scores in contests such as [[Olympic figure skating]], where they are intended to limit the impact of biased or strategic judges.
The first [[Highest median voting rules|highest median rule]] to be developed was [[Bucklin voting]], a system used by [[Progressive era]] reformers in the United States.
The full system of
<blockquote>
Line 311:
It has since been used in judging wine competitions and in other political research polling in France and in the US.<ref>Balinski M. and R. Laraki (2010) «Judge: Don't vote». Cahier du Laboratoire d’Econométrie de l’Ecole Polytechnique 2010-27.</ref>
== Variants ==
Varloot and Laraki<ref name=":1">{{Cite book |last1=Varloot |first1=Estelle Marine |last2=Laraki |first2=Rida |chapter=Level-strategyproof Belief Aggregation Mechanisms |date=2022-07-13 |title=Proceedings of the 23rd ACM Conference on Economics and Computation |chapter-url=https://doi.org/10.1145/3490486.3538309 |series=EC '22 |location=New York, NY, USA |publisher=Association for Computing Machinery |pages=335–369 |doi=10.1145/3490486.3538309 |isbn=978-1-4503-9150-4|arxiv=2108.04705 }}</ref> present a variant of majority judgement, called majority judgement with uncertainty (MJU), which allows voters to express uncertainty about each candidate's merits.
==See also==
* [[
*[[Approval voting]]
* [[Range voting]]
* [[Voting system]]
Line 319 ⟶ 323:
== Notes ==
{{notelist}}
== References ==
|