Submission declined on 21 April 2024 by
ToadetteEdit (
talk). This submission is not adequately supported by
reliable sources. Reliable sources are required so that information can be
verified. If you need help with referencing, please see
Referencing for beginners and
Citing sources.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
|
Submission declined on 3 November 2023 by
Theroadislong (
talk). This draft's references do not show that the subject
qualifies for a Wikipedia article. In summary, the draft needs multiple published sources that are:
|
Submission declined on 3 November 2023 by
Vanderwaalforces (
talk). Wikipedia is an
encyclopedia and
not a dictionary. We cannot accept articles that are little more than definitions of words or abbreviations as entries. A good article should begin with a good definition, but expand on the subject. You might try creating a definition for this instead at
Wiktionary, which is a dictionary. Please only do so if it meets that sister project's
criteria for inclusion. These require among others, attestation for the word or phrase, as verified through clear widespread use, or its use in permanently recorded media, conveying meaning, in at least three independent instances spanning at least a year. This submission does not appear to be written in
the formal tone expected of an encyclopedia article. Entries should be written from a
neutral point of view, and should refer to a range of
independent, reliable, published sources. Please rewrite your submission in a more encyclopedic format. Please make sure to avoid
peacock terms that promote the subject. |
The favorite betrayal or sincere favorite criterion is a voting system criterion which requires that no incentive to vote for someone else over their favorite". is always safe for a voter to give their true favorite maximum support, without having to worry that doing so will cause a worse outcome.
Systems which allow the voter to give each candidate an independent evaluation, known as cardinal voting systems, typically satisfy this criterion. [1] [2] These systems include approval voting, median voting, and score voting. [3] [4] [5]
Most ordinal voting systems do not satisfy this criterion. For instance, Borda count, Copeland's method, instant runoff voting, minimax condorcet, ranked pairs, and the Schulze method all fail this criterion. It is also failed by plurality voting and two-round runoff voting. [3] [4] [6]
The favorite betrayal criterion is defined as follows:
The criterion permits the strategy of insincerely ranking another candidate equal to one's favorite. A related but stronger criterion, the strong favorite betrayal criterion, disallows this. [7]
With the existence of Arrow's theorem and Gibbard's theorem, no perfect voting system may exist, and so advocates are forced to choose among a set of flawed options. [8] Proponents of cardinal systems argue that the favorite betrayal criterion is of high importance, because it enables voters to honestly give their true favorite maximum support without need for worry. Arguments against the criteria contend that other, conflicting criteria are more important.
Equal Vote, a major proponent of STAR voting, argues that a voting system must reward voter honesty, both on the individual level and in the aggregate. Thus they consider the favorite betrayal criterion to be of high importance. [9] The Center for Election Science has argued that systems that fail the favorite betrayal criterion is a major flaw in both first-past-the-post and instant runoff voting, incentivizing voters to cast dishonest ballots and resulting in lower voter satisfaction. [10] [11]
Democracy Chronicles, an online publication whose mission is to strengthen democracy worldwide, argues that the favorite betrayal criterion is paramount, since failure can open the door for misinformation campaigns to push voters to cast insincere ballots. They argue that the current media landscape and public perception of election systems requires that giving one's preferred candidate maximum support must always be the best strategy, so that no one can be convinced to do otherwise for any reason. [12]
The Sightline Institute, an organization dedicated to making Cascadia "a global model of sustainability," argues that the criteria's importance depends on a voter's relative perceived value between it and later-no-harm, a mutually-exclusive criterion which states that it must always be safe to give second-favorite candidates support after a top favorite. [13] According to Sightline, if voters feel strongly that their favorite should win but still want to express opinions about other candidates, they should be more drawn towards systems which satisfy later-no-harm. If they feel that any of their preferred candidates winning would provide sufficient satisfaction, then later-no-harm is not as necessary and the favorite betrayal criterion is helpful to ensure that showing support for their true favorite cannot possibly backfire. Voters of the first variety may choose to bullet vote under systems which pass the favorite betrayal criterion, not wanting to accidentally cause a less preferred candidate to beat their favorite. However, under a system which fails the favorite betrayal criterion, any voter may choose to strategically betray their favorite candidate in order to secure a more favorable result. [5]
The following will provide an example and explain how score voting satisfies the favorite betrayal criterion. Score voting functions as follows:
Assume there are three candidates: Agnew, BillyJoe, and Cletus. The voters may give scores up to 5. The vote totals appear as follows:
Candidate | Total score |
---|---|
Agnew | 35 |
BillyJoe | 39 |
Cletus | 22 |
Assume there is one final voter who has yet to cast their vote, and they know the results as they currently stand. This voter could have any of the following six preferences among the candidates:
If Agnew or BillyJoe is the voter's true favorite, as in scenarios 1-4, the best strategy is to give their true favorite 5 points. This would cause their favorite to win and so no better outcome is possible.
If the voter's true favorite is Cletus, it is safe to give Cletus 5 points. Doing so would not change the scores or relative standing of Agnew and BillyJoe. If the voter wishes to control the outcome of the election, they must also award points to both Agnew and BillyJoe. In this scenario, the voter must give Agnew 5 points if they wish for them to win, but doing so merely places Agnew at the same level of support as Cletus. Since the voter has no incentive to lower their support for Cletus, score voting passes the favorite betrayal criterion.
This example shows that Borda count violates the favorite betrayal criterion. Borda count functions as follows:
Assume there are three candidates Alfred, Betty and Carl with 8 voters and the following preferences:
# of voters | Preferences |
---|---|
2 | Alfred > Betty > Carl |
3 | Betty > Carl > Alfred |
3 | Carl > Alfred > Betty |
Assuming all voters vote in a sincere way, the positions of the candidates and computation of the Borda points can be tabulated as follows:
candidate | #1. | #2. | #last | computation | Borda points |
---|---|---|---|---|---|
Alfred | 2 | 3 | 3 | 2*2 + 3*1 | 7 |
Betty | 3 | 2 | 3 | 3*2 + 2*1 | 8 |
Carl | 3 | 3 | 2 | 3*2 + 3*1 | 9 |
Result: Carl wins with 9 Borda points.
Assuming the voters that favored Alfred (marked bold) realize the situation and insincerely vote for Betty ahead of Alfred:
# of voters | Preferences |
---|---|
2 | Betty > Alfred > Carl |
3 | Betty > Carl > Alfred |
3 | Carl > Alfred > Betty |
The positions of the candidates and computation of the Borda points would be:
candidate | #1. | #2. | #last | computation | Borda points |
---|---|---|---|---|---|
Alfred | 0 | 5 | 3 | 0*2 + 5*1 | 5 |
Betty | 5 | 0 | 3 | 5*2 + 0*1 | 10 |
Carl | 3 | 3 | 2 | 3*2 + 3*1 | 9 |
Result: Betty wins with 10 Borda points.
By insincerely listing Betty ahead of their true favorite, Alfred, the two voters obtained a more preferred outcome, causing Betty to win instead of Carl. There is no way to give Betty more support without putting her ahead of Alfred and there is no way for the same voters to lower their support for Carl. Thus, there is no way for these voters to enable Betty to beat Carl without putting Betty ahead of Alfred. Because the construction of this scenario is possible, Borda count fails the favorite betrayal criterion.
This example shows that the two-round runoff voting system violates the favorite betrayal criterion. This method functions as follows:
Assume there are three candidates: Anna, Beverly, and Clay. There are 17 voters with the following preferences:
# of voters | Preferences |
---|---|
8 | Anna > Beverly > Clay |
5 | Beverly > Anna > Clay |
4 | Clay > Beverly > Anna |
Assuming all voters vote in a sincere way, the results from the first round and the runoff would be:
# of voters | ||
---|---|---|
Candidate | 1st round | Runoff |
Anna | 8 | 8 |
Beverly | 5 | 9 |
Clay | 4 | – |
Thus, Clay is eliminated and there is a runoff between Anna and Beverly. Since all voters of Clay prefer Beverly over Anna, Beverly benefits from Clay's elimination.
Result: By picking up the voters who would have rather voted for Clay, Beverly wins with 9 votes against Anna, who only has 8.
Assuming Anna's voters realize the situation and two of them insincerely vote for Clay instead of their favorite, Anna. The results would be:
# of voters | ||
---|---|---|
Candidate | 1st round | Runoff |
Anna | 6 | 13 |
Beverly | 5 | – |
Clay | 6 | 4 |
Anna and Clay proceed to the runoff, while Beverly is eliminated. Anna benefits from this situation, since the voters which favor Beverly, prefer Anna over Clay.
Result: By acquiring the votes of the voters favoring Beverly, Anna wins easily against Clay with a score of 13 to 4.
By voting for their least preferred candidate, Clay, instead of their favorite, Anna, the insincere voters caused Beverly to lose in the first round. This caused Anna to become the winner in the final round, a more acceptable outcome for these voters. There is no other way for these voters to cause Anna to win, and so the two-round runoff system fails the favorite betrayal criterion.
This example shows that instant-runoff voting violates the favorite betrayal criterion. Note that the example for the two-round runoff voting system also works as an example for instant-runoff voting. Instant-runoff functions as follows:
Assume there are four candidates: Amy, Bert, Cindy, and Dan. This election has 41 voters with the following preferences:
# of voters | Preferences |
---|---|
10 | Amy > Bert > Cindy > Dan |
6 | Bert > Amy > Cindy > Dan |
5 | Cindy > Bert > Amy > Dan |
20 | Dan > Amy > Cindy > Bert |
Assuming all voters vote in a sincere way, Cindy is awarded only 5 first place votes and is eliminated first. Her votes are transferred to Bert. In the second round, Amy is eliminated with only 10 votes. Her votes are transferred to Bert as well. Finally, Bert has 21 votes and wins against Dan, who has 20 votes.
Votes in round/ Candidate |
1st | 2nd | 3rd |
---|---|---|---|
Amy | 10 | 10 | – |
Bert | 6 | 11 | 21 |
Cindy | 5 | – | – |
Dan | 20 | 20 | 20 |
Result: Bert wins against Dan, after Cindy and Amy were eliminated.
Now assume two of the voters who favor Amy (marked bold) realize the situation and insincerely vote for Cindy instead of Amy:
# of voters | Ballots |
---|---|
2 | Cindy > Amy > Bert > Dan |
8 | Amy > Bert > Cindy > Dan |
6 | Bert > Amy > Cindy > Dan |
5 | Cindy > Bert > Amy > Dan |
20 | Dan > Amy > Cindy > Bert |
In this scenario, Cindy has 7 first place votes and so Bert is eliminated first with only 6 first place votes. His votes are transferred to Amy. In the second round, Cindy is eliminated with only 10 votes. Her votes are transferred to Amy as well. Finally, Amy has 21 votes and wins against Dan, who has 20 votes.
Votes in round/ Candidate |
1st | 2nd | 3rd |
---|---|---|---|
Amy | 8 | 14 | 21 |
Bert | 6 | – | – |
Cindy | 7 | 7 | – |
Dan | 20 | 20 | 20 |
Result: Amy wins against Dan, after Bert and Cindy has been eliminated.
By listing Cindy ahead of their true favorite, Amy, the two insincere voters obtained a more preferred outcome (causing their favorite candidate to win). There was no way to achieve this without raising another candidate ahead of their sincere favorite. Thus, instant-runoff voting fails the favorite betrayal criterion.
A key feature of evaluative voting is a form of independence: the voter can evaluate all the candidates in turn ... another feature of evaluative voting ... is that voters can express some degree of preference.
Category: voting systems
Category: elections
Category: mathematics
Category: game theory
Category: political science
Submission declined on 21 April 2024 by
ToadetteEdit (
talk). This submission is not adequately supported by
reliable sources. Reliable sources are required so that information can be
verified. If you need help with referencing, please see
Referencing for beginners and
Citing sources.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
|
Submission declined on 3 November 2023 by
Theroadislong (
talk). This draft's references do not show that the subject
qualifies for a Wikipedia article. In summary, the draft needs multiple published sources that are:
|
Submission declined on 3 November 2023 by
Vanderwaalforces (
talk). Wikipedia is an
encyclopedia and
not a dictionary. We cannot accept articles that are little more than definitions of words or abbreviations as entries. A good article should begin with a good definition, but expand on the subject. You might try creating a definition for this instead at
Wiktionary, which is a dictionary. Please only do so if it meets that sister project's
criteria for inclusion. These require among others, attestation for the word or phrase, as verified through clear widespread use, or its use in permanently recorded media, conveying meaning, in at least three independent instances spanning at least a year. This submission does not appear to be written in
the formal tone expected of an encyclopedia article. Entries should be written from a
neutral point of view, and should refer to a range of
independent, reliable, published sources. Please rewrite your submission in a more encyclopedic format. Please make sure to avoid
peacock terms that promote the subject. |
The favorite betrayal or sincere favorite criterion is a voting system criterion which requires that no incentive to vote for someone else over their favorite". is always safe for a voter to give their true favorite maximum support, without having to worry that doing so will cause a worse outcome.
Systems which allow the voter to give each candidate an independent evaluation, known as cardinal voting systems, typically satisfy this criterion. [1] [2] These systems include approval voting, median voting, and score voting. [3] [4] [5]
Most ordinal voting systems do not satisfy this criterion. For instance, Borda count, Copeland's method, instant runoff voting, minimax condorcet, ranked pairs, and the Schulze method all fail this criterion. It is also failed by plurality voting and two-round runoff voting. [3] [4] [6]
The favorite betrayal criterion is defined as follows:
The criterion permits the strategy of insincerely ranking another candidate equal to one's favorite. A related but stronger criterion, the strong favorite betrayal criterion, disallows this. [7]
With the existence of Arrow's theorem and Gibbard's theorem, no perfect voting system may exist, and so advocates are forced to choose among a set of flawed options. [8] Proponents of cardinal systems argue that the favorite betrayal criterion is of high importance, because it enables voters to honestly give their true favorite maximum support without need for worry. Arguments against the criteria contend that other, conflicting criteria are more important.
Equal Vote, a major proponent of STAR voting, argues that a voting system must reward voter honesty, both on the individual level and in the aggregate. Thus they consider the favorite betrayal criterion to be of high importance. [9] The Center for Election Science has argued that systems that fail the favorite betrayal criterion is a major flaw in both first-past-the-post and instant runoff voting, incentivizing voters to cast dishonest ballots and resulting in lower voter satisfaction. [10] [11]
Democracy Chronicles, an online publication whose mission is to strengthen democracy worldwide, argues that the favorite betrayal criterion is paramount, since failure can open the door for misinformation campaigns to push voters to cast insincere ballots. They argue that the current media landscape and public perception of election systems requires that giving one's preferred candidate maximum support must always be the best strategy, so that no one can be convinced to do otherwise for any reason. [12]
The Sightline Institute, an organization dedicated to making Cascadia "a global model of sustainability," argues that the criteria's importance depends on a voter's relative perceived value between it and later-no-harm, a mutually-exclusive criterion which states that it must always be safe to give second-favorite candidates support after a top favorite. [13] According to Sightline, if voters feel strongly that their favorite should win but still want to express opinions about other candidates, they should be more drawn towards systems which satisfy later-no-harm. If they feel that any of their preferred candidates winning would provide sufficient satisfaction, then later-no-harm is not as necessary and the favorite betrayal criterion is helpful to ensure that showing support for their true favorite cannot possibly backfire. Voters of the first variety may choose to bullet vote under systems which pass the favorite betrayal criterion, not wanting to accidentally cause a less preferred candidate to beat their favorite. However, under a system which fails the favorite betrayal criterion, any voter may choose to strategically betray their favorite candidate in order to secure a more favorable result. [5]
The following will provide an example and explain how score voting satisfies the favorite betrayal criterion. Score voting functions as follows:
Assume there are three candidates: Agnew, BillyJoe, and Cletus. The voters may give scores up to 5. The vote totals appear as follows:
Candidate | Total score |
---|---|
Agnew | 35 |
BillyJoe | 39 |
Cletus | 22 |
Assume there is one final voter who has yet to cast their vote, and they know the results as they currently stand. This voter could have any of the following six preferences among the candidates:
If Agnew or BillyJoe is the voter's true favorite, as in scenarios 1-4, the best strategy is to give their true favorite 5 points. This would cause their favorite to win and so no better outcome is possible.
If the voter's true favorite is Cletus, it is safe to give Cletus 5 points. Doing so would not change the scores or relative standing of Agnew and BillyJoe. If the voter wishes to control the outcome of the election, they must also award points to both Agnew and BillyJoe. In this scenario, the voter must give Agnew 5 points if they wish for them to win, but doing so merely places Agnew at the same level of support as Cletus. Since the voter has no incentive to lower their support for Cletus, score voting passes the favorite betrayal criterion.
This example shows that Borda count violates the favorite betrayal criterion. Borda count functions as follows:
Assume there are three candidates Alfred, Betty and Carl with 8 voters and the following preferences:
# of voters | Preferences |
---|---|
2 | Alfred > Betty > Carl |
3 | Betty > Carl > Alfred |
3 | Carl > Alfred > Betty |
Assuming all voters vote in a sincere way, the positions of the candidates and computation of the Borda points can be tabulated as follows:
candidate | #1. | #2. | #last | computation | Borda points |
---|---|---|---|---|---|
Alfred | 2 | 3 | 3 | 2*2 + 3*1 | 7 |
Betty | 3 | 2 | 3 | 3*2 + 2*1 | 8 |
Carl | 3 | 3 | 2 | 3*2 + 3*1 | 9 |
Result: Carl wins with 9 Borda points.
Assuming the voters that favored Alfred (marked bold) realize the situation and insincerely vote for Betty ahead of Alfred:
# of voters | Preferences |
---|---|
2 | Betty > Alfred > Carl |
3 | Betty > Carl > Alfred |
3 | Carl > Alfred > Betty |
The positions of the candidates and computation of the Borda points would be:
candidate | #1. | #2. | #last | computation | Borda points |
---|---|---|---|---|---|
Alfred | 0 | 5 | 3 | 0*2 + 5*1 | 5 |
Betty | 5 | 0 | 3 | 5*2 + 0*1 | 10 |
Carl | 3 | 3 | 2 | 3*2 + 3*1 | 9 |
Result: Betty wins with 10 Borda points.
By insincerely listing Betty ahead of their true favorite, Alfred, the two voters obtained a more preferred outcome, causing Betty to win instead of Carl. There is no way to give Betty more support without putting her ahead of Alfred and there is no way for the same voters to lower their support for Carl. Thus, there is no way for these voters to enable Betty to beat Carl without putting Betty ahead of Alfred. Because the construction of this scenario is possible, Borda count fails the favorite betrayal criterion.
This example shows that the two-round runoff voting system violates the favorite betrayal criterion. This method functions as follows:
Assume there are three candidates: Anna, Beverly, and Clay. There are 17 voters with the following preferences:
# of voters | Preferences |
---|---|
8 | Anna > Beverly > Clay |
5 | Beverly > Anna > Clay |
4 | Clay > Beverly > Anna |
Assuming all voters vote in a sincere way, the results from the first round and the runoff would be:
# of voters | ||
---|---|---|
Candidate | 1st round | Runoff |
Anna | 8 | 8 |
Beverly | 5 | 9 |
Clay | 4 | – |
Thus, Clay is eliminated and there is a runoff between Anna and Beverly. Since all voters of Clay prefer Beverly over Anna, Beverly benefits from Clay's elimination.
Result: By picking up the voters who would have rather voted for Clay, Beverly wins with 9 votes against Anna, who only has 8.
Assuming Anna's voters realize the situation and two of them insincerely vote for Clay instead of their favorite, Anna. The results would be:
# of voters | ||
---|---|---|
Candidate | 1st round | Runoff |
Anna | 6 | 13 |
Beverly | 5 | – |
Clay | 6 | 4 |
Anna and Clay proceed to the runoff, while Beverly is eliminated. Anna benefits from this situation, since the voters which favor Beverly, prefer Anna over Clay.
Result: By acquiring the votes of the voters favoring Beverly, Anna wins easily against Clay with a score of 13 to 4.
By voting for their least preferred candidate, Clay, instead of their favorite, Anna, the insincere voters caused Beverly to lose in the first round. This caused Anna to become the winner in the final round, a more acceptable outcome for these voters. There is no other way for these voters to cause Anna to win, and so the two-round runoff system fails the favorite betrayal criterion.
This example shows that instant-runoff voting violates the favorite betrayal criterion. Note that the example for the two-round runoff voting system also works as an example for instant-runoff voting. Instant-runoff functions as follows:
Assume there are four candidates: Amy, Bert, Cindy, and Dan. This election has 41 voters with the following preferences:
# of voters | Preferences |
---|---|
10 | Amy > Bert > Cindy > Dan |
6 | Bert > Amy > Cindy > Dan |
5 | Cindy > Bert > Amy > Dan |
20 | Dan > Amy > Cindy > Bert |
Assuming all voters vote in a sincere way, Cindy is awarded only 5 first place votes and is eliminated first. Her votes are transferred to Bert. In the second round, Amy is eliminated with only 10 votes. Her votes are transferred to Bert as well. Finally, Bert has 21 votes and wins against Dan, who has 20 votes.
Votes in round/ Candidate |
1st | 2nd | 3rd |
---|---|---|---|
Amy | 10 | 10 | – |
Bert | 6 | 11 | 21 |
Cindy | 5 | – | – |
Dan | 20 | 20 | 20 |
Result: Bert wins against Dan, after Cindy and Amy were eliminated.
Now assume two of the voters who favor Amy (marked bold) realize the situation and insincerely vote for Cindy instead of Amy:
# of voters | Ballots |
---|---|
2 | Cindy > Amy > Bert > Dan |
8 | Amy > Bert > Cindy > Dan |
6 | Bert > Amy > Cindy > Dan |
5 | Cindy > Bert > Amy > Dan |
20 | Dan > Amy > Cindy > Bert |
In this scenario, Cindy has 7 first place votes and so Bert is eliminated first with only 6 first place votes. His votes are transferred to Amy. In the second round, Cindy is eliminated with only 10 votes. Her votes are transferred to Amy as well. Finally, Amy has 21 votes and wins against Dan, who has 20 votes.
Votes in round/ Candidate |
1st | 2nd | 3rd |
---|---|---|---|
Amy | 8 | 14 | 21 |
Bert | 6 | – | – |
Cindy | 7 | 7 | – |
Dan | 20 | 20 | 20 |
Result: Amy wins against Dan, after Bert and Cindy has been eliminated.
By listing Cindy ahead of their true favorite, Amy, the two insincere voters obtained a more preferred outcome (causing their favorite candidate to win). There was no way to achieve this without raising another candidate ahead of their sincere favorite. Thus, instant-runoff voting fails the favorite betrayal criterion.
A key feature of evaluative voting is a form of independence: the voter can evaluate all the candidates in turn ... another feature of evaluative voting ... is that voters can express some degree of preference.
Category: voting systems
Category: elections
Category: mathematics
Category: game theory
Category: political science