Random ballot

Last updated

The term random ballot or random dictatorship refers to a randomized electoral system where the election is decided on the basis of a single randomly-selected ballot. [1] [2] A closely-related variant is called random serial (or sequential) dictatorship, which repeats the procedure and draws another ballot if multiple candidates are tied on the first ballot.

Contents

Random dictatorship was first described in 1977 by Allan Gibbard, who showed it to be the unique social choice rule that treats all voters equally while still being strategyproof in all situations. [3] Its application to elections was first described in 1984 by Akhil Reed Amar. [4]

While rarely, if ever, suggested as a serious electoral system, the rule is often used as a tiebreaker.

Properties

Single-winner

Satisfied criteria include:

Failed criteria include:

For multimember bodies

If the random ballot is used to select the members of a multi-constituency body, it can serve to retain the attractive features of both first past the post and proportional representation.

As the winner of each ballot is chosen randomly, the party with the largest vote share is most likely to get the greatest number of candidates. In fact, as the number of ballots grows, the percentage representation of each party in the elected body will get closer and closer to their actual proportion of the vote across the entire electorate. At the same time, the chance of a randomly selected highly unrepresentative body diminishes.

For example, a minority party with 1% of the vote might have a 1/100 chance of getting a seat in each ballot. In a 50-person assembly, the probability of a majority for this party being chosen by random ballot is approximately (using the binomial distribution CDF)

This is a vanishingly small chance, which negates the possibility of small parties winning majorities due to random chance.

At same time, the random ballot preserves a local representative for each constituency, although this individual may not have received a majority of votes of their constituents.

Prevalence

There are no examples of the random ballot in use in practice, but it has been used as a thought experiment, [5] and it is occasionally used in real life as a tiebreaker for other methods.

Randomness in other electoral systems

There are various other elements of randomness (other than tie-breaking) in existing electoral systems:

1. Randomly ordering candidates on a list. It is often observed that candidates who are placed in a high position on the ballot-paper will receive extra votes as a result, from voters who are apathetic (especially in elections with compulsory voting) or who have a strong preference for a party but are indifferent among individual candidates representing that party (when there are two or more). For this reason, many societies have abandoned traditional alphabetical listing of candidates on the ballot in favour of either ranking by the parties (e.g., the Australian Senate), placement by lot, or rotation (e.g., Hare-Clark STV-PR system used in Tasmania and the Australian Capital Territory). When candidates are ordered by lot on the ballot, the advantage of donkey voting can be decisive in a close race.

2. Randomly selecting votes for transfer. In some single transferable vote (STV) systems of proportional representation, an elected candidate's surplus of votes over and above the quota is transferred by selecting the required number of ballot papers at random. Thus, if the quota is 1,000 votes, a candidate who polls 1,200 first preference votes has a surplus of 200 votes that s/he does not need. In some STV systems (Ireland since 1922, and Australia from 1918 to 1984), electoral officials select 200 ballot-papers randomly from the 1,200. However, this has been criticised since it is not replicable if a recount is required. As a result, Australia has adopted a variant of fractional transfer, a.k.a. the "Gregory method", by which all 1,200 ballot-papers are transferred but are marked down in value to 0.1666 (one-sixth) of a vote each. This means that 1,000 votes "stay with" the elected candidate, while the value of the 1,200 ballot-papers transferred equals only 200 votes.

3. Randomly selecting winners. This method is called sortition : rather than choosing ballots, it chooses candidates directly by lot, with no input from the voters (except perhaps a nominating or screening process). This is not the same as random ballot, since random ballot is weighted in favor of candidates who receive more votes. Random ballot would behave identically to random winner only if all candidates received the same number of votes.

See also

Related Research Articles

<span class="mw-page-title-main">Proportional representation</span> Voting system that makes outcomes proportional to vote totals

Proportional representation (PR) refers to any type of electoral system under which subgroups of an electorate are reflected proportionately in the elected body. The concept applies mainly to political divisions among voters. The essence of such systems is that all votes cast – or almost all votes cast – contribute to the result and are effectively used to help elect someone – not just a bare plurality or (exclusively) the majority – and that the system produces mixed, balanced representation reflecting how votes are cast.

<span class="mw-page-title-main">Single transferable vote</span> Multi-winner electoral system

The single transferable vote (STV), sometimes known as proportional ranked choice voting (P-RCV), is a multi-winner electoral system in which each voter casts a single vote in the form of a ranked-choice ballot. Voters have the option to rank candidates, and their vote may be transferred according to alternate preferences if their preferred candidate is eliminated or elected with surplus votes, so that their vote is used to elect someone they prefer over others in the running. STV aims to approach proportional representation based on votes cast in the district where it is used, so that each vote is worth about the same as another.

Strategic or tactical voting is a situation where a voter considers the possible ballots cast by other voters in order to maximize their satisfaction with the election's results. For example, in plurality or instant-runoff, a voter may recognize their favorite candidate is unlikely to win and so instead support a candidate they think is more likely to win.

<span class="mw-page-title-main">Voting</span> Method to make collective decisions

Voting is a method by which a group, such as a meeting or an electorate, convenes together for the purpose of making a collective decision or expressing an opinion usually following discussions, debates or election campaigns. Democracies elect holders of high office by voting. Residents of a jurisdiction represented by an elected official are called "constituents", and the constituents who choose to cast a ballot for their chosen candidate are called "voters." There are different systems for collecting votes, but while many of the systems used in decision-making can also be used as electoral systems, any which cater to proportional representation can only be used in elections.

The Gibbard–Satterthwaite theorem is a theorem in voting theory. It was first conjectured by the philosopher Michael Dummett and the mathematician Robin Farquharson in 1961 and then proved independently by the philosopher Allan Gibbard in 1973 and economist Mark Satterthwaite in 1975. It deals with deterministic ordinal electoral systems that choose a single winner, and states that for every voting rule of this form, at least one of the following three things must hold:

  1. The rule is dictatorial, i.e. there exists a distinguished voter who can choose the winner; or
  2. The rule limits the possible outcomes to two alternatives only; or
  3. The rule is susceptible to tactical voting: in some situations, a voter's sincere ballot may not best defend their opinion.
<span class="mw-page-title-main">2005 British Columbia electoral reform referendum</span> Referendum on electoral reform in 2005

A referendum was held in the Canadian province of British Columbia on May 17, 2005, to determine whether or not to adopt the recommendation of the Citizens' Assembly on Electoral Reform to replace the existing first-past-the-post electoral system (FPTP) with a single transferable vote system (BC-STV). It was held in conjunction with the BC Legislative Assembly election of 2005. Voters were given two ballots at that time: a ballot to vote for a Member of the Legislative Assembly of British Columbia (MLA) in their constituency and a referendum ballot. The referendum received considerable support from the electorate but failed in meeting the 60-percent threshold that had been set. A second referendum was held in 2009.

BC-STV is the proposed voting system recommended by the Citizens' Assembly on Electoral Reform in October 2004 for use in British Columbia, and belongs to the single transferable vote family of voting systems. BC-STV was supported by a majority of the voters in a referendum held in 2005 but the government had legislated that it would not be bound by any vote lower than 60 percent in favour. Because of the strong majority support for BC-STV, the government elected to stage a second referendum in 2009, but with increased public funding for information campaigns to better inform the electorate about the differences between the existing and proposed systems. The leadership of both the "yes" side and the "no" side were assigned by the government. The proposal was rejected with 60.9 percent voting against, vs. 39.1 percent in favour, in the 2009 vote.

The single transferable vote (STV) is a proportional representation voting system that elects multiple winners. It is one of several ways of choosing winners from ballots that rank candidates by preference. Under STV, an elector's vote is initially allocated to their most-preferred candidate. Candidates are elected (winners) if their vote tally reaches quota. After this 1st Count, if seats still remain open, surplus votes are transferred from winners to remaining candidates (hopefuls) according to the surplus ballots' next usable back-up preference. if no surplus votes have to be transferred, then the least-popular candidate is eliminated so the vote has chance to be placed on a candidate who can use it.

Allan Fletcher Gibbard is the Richard B. Brandt Distinguished University Professor of Philosophy Emeritus at the University of Michigan, Ann Arbor. Gibbard has made major contributions to contemporary ethical theory, in particular metaethics, where he has developed a contemporary version of non-cognitivism. He has also published articles in the philosophy of language, metaphysics, and social choice theory: in social choice, he first proved the result known today as Gibbard-Satterthwaite theorem, which had been previously conjectured by Michael Dummett and Robin Farquharson.

There are a number of complications and issues surrounding the application and use of single transferable vote proportional representation that form the basis of discussions between its advocates and detractors.

Instant-runoff voting (IRV), also known as plurality with elimination or plurality loser, is a ranked-choice voting system that modifies plurality by repeatedly eliminating the last-place winner until only one candidate is left. In the United Kingdom, it is generally called the alternative vote (AV). In the United States, IRV is often conflated with ranked-choice voting (RCV); however, this conflation is not completely standard, and social choice theorists tend to prefer more explicit terms.

In social choice theory, a dictatorship mechanism is a rule by which, among all possible alternatives, the results of voting mirror a single pre-determined person's preferences, without consideration of the other voters. Dictatorship by itself is not considered a good mechanism in practice, but it is theoretically important: by Arrow's impossibility theorem, when there are at least three alternatives, dictatorship is the only ranked voting electoral system that satisfies unrestricted domain, Pareto efficiency, and independence of irrelevant alternatives. Similarly, by Gibbard's theorem, when there are at least three alternatives, dictatorship is the only strategyproof rule.

<span class="mw-page-title-main">Electoral system</span> Method by which voters make a choice between options

An electoral system or voting system is a set of rules that determine how elections and referendums are conducted and how their results are determined. Electoral systems are used in politics to elect governments, while non-political elections may take place in business, non-profit organisations and informal organisations. These rules govern all aspects of the voting process: when elections occur, who is allowed to vote, who can stand as a candidate, how ballots are marked and cast, how the ballots are counted, how votes translate into the election outcome, limits on campaign spending, and other factors that can affect the result. Political electoral systems are defined by constitutions and electoral laws, are typically conducted by election commissions, and can use multiple types of elections for different offices.

<span class="mw-page-title-main">Ranked voting</span> Family of electoral systems

The term ranked voting, also known as preferential voting or ranked-choice voting, pertains to any voting system where voters indicate a rank to order candidates or options—in a sequence from first, second, third, and onwards—on their ballots. Ranked voting systems vary based on the ballot marking process, how preferences are tabulated and counted, the number of seats available for election, and whether voters are allowed to rank candidates equally.

Maximal lotteries are a probabilistic voting method and tournament solution, first proposed by the French mathematician and social scientist Germain Kreweras in 1965, and popularized by Peter Fishburn. The method uses ranked ballots and returns the probability distribution of candidates that is preferred by a majority of voters to any other.


A major branch of social choice theory is devoted to the comparison of electoral systems, otherwise known as social choice functions. Viewed from the perspective of political science, electoral systems are rules for conducting elections and determining winners from the ballots cast. From the perspective of economics, mathematics, and philosophy, a social choice function is a mathematical function that determines how a society should make choices, given a collection of individual preferences.

In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973. It states that for any deterministic process of collective decision, at least one of the following three properties must hold:

  1. The process is dictatorial, i.e. there is a single voter whose vote chooses the outcome.
  2. The process limits the possible outcomes to two options only.
  3. The process is not straightforward; the optimal ballot for a voter depends on their beliefs about other voters' ballots.

Multiwinner approval voting, also called approval-based committee (ABC) voting, is a multi-winner electoral system that uses approval ballots. Each voter may select ("approve") any number of candidates, and multiple candidates are elected. The number of elected candidates is usually fixed in advance. For example, it can be the number of seats in a country's parliament, or the required number of members in a committee.

Fractional social choice is a branch of social choice theory in which the collective decision is not a single alternative, but rather a weighted sum of two or more alternatives. For example, if society has to choose between three candidates: A B or C, then in standard social choice, exactly one of these candidates is chosen, while in fractional social choice, it is possible to choose "2/3 of A and 1/3 of B".

Fractional approval voting is an electoral system using approval ballots, in which the outcome is fractional: for each alternative j there is a fraction pj between 0 and 1, such that the sum of pj is 1. It can be seen as a generalization of approval voting: in the latter, one candidate wins and the other candidates lose. The fractions pj can be interpreted in various ways, depending on the setting. Examples are:

References

  1. Sewell, Roger; MacKay, David; McLean, Iain (January 2009). "Probabilistic electoral methods, representative probability, and maximum entropy". Voting Matters. 26: 22. A voter is picked at random and the output ordering of the election is set to be the ordering given by that voter.
  2. Zeckhauser, Richard (1973). "Voting Systems, Honest Preferences and Pareto Optimality". American Political Science Review. 67 (3): 938–940. doi:10.2307/1958635. ISSN   0003-0554. JSTOR   1958635. S2CID   147293110. Each individual writes the name of a candidate on a ballot. The voters' ballots are collected and placed in a revolving drum. After shuffling, a ballot is chosen at random. The name on the chosen ballot is the elected candidate.
  3. Gibbard, Allan (1973). "Manipulation of Voting Schemes: A General Result". Econometrica. 41 (4): 592–593. doi:10.2307/1914083. ISSN   0012-9682. JSTOR   1914083. S2CID   17069971. In other words, each voter writes his first choice on a ballot; a single ballot is drawn at random; and the choice on that ballot is selected.
  4. Akhil Reed Amar (June 1984). "Choosing representatives by lottery voting" (PDF). Yale Law Journal . 93 (7): 1283–1308. doi:10.2307/796258. JSTOR   796258. Archived from the original (PDF) on 2006-08-31.
  5. Akhil Reed Amar (1 January 1995). "Lottery Voting: A Thought Experiment".