Association Française pour le Nommage Internet en Coopération. Election methods.

Similar documents
Fairness Criteria. Review: Election Methods

The Mathematics of Voting

Voting. Suppose that the outcome is determined by the mean of all voter s positions.

Head-to-Head Winner. To decide if a Head-to-Head winner exists: Every candidate is matched on a one-on-one basis with every other candidate.

Voting Criteria: Majority Criterion Condorcet Criterion Monotonicity Criterion Independence of Irrelevant Alternatives Criterion

Practice TEST: Chapter 14

Exercises For DATA AND DECISIONS. Part I Voting

Arrow s Impossibility Theorem

Chapter 1 Practice Test Questions

1.6 Arrow s Impossibility Theorem

Voting rules: (Dixit and Skeath, ch 14) Recall parkland provision decision:

The Impossibilities of Voting

Fairness Criteria. Majority Criterion: If a candidate receives a majority of the first place votes, that candidate should win the election.

Section 3: The Borda Count Method. Example 4: Using the preference schedule from Example 3, identify the Borda candidate.

9.3 Other Voting Systems for Three or More Candidates

12.2 Defects in Voting Methods

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

(67686) Mathematical Foundations of AI June 18, Lecture 6

Desirable properties of social choice procedures. We now outline a number of properties that are desirable for these social choice procedures:

Recall: Properties of ranking rules. Recall: Properties of ranking rules. Kenneth Arrow. Recall: Properties of ranking rules. Strategically vulnerable

Write all responses on separate paper. Use complete sentences, charts and diagrams, as appropriate.

Elections with Only 2 Alternatives

Introduction: The Mathematics of Voting

Measuring Fairness. Paul Koester () MA 111, Voting Theory September 7, / 25

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Social welfare functions

Math for Liberal Studies

CSC304 Lecture 16. Voting 3: Axiomatic, Statistical, and Utilitarian Approaches to Voting. CSC304 - Nisarg Shah 1

n(n 1) 2 C = total population total number of seats amount of increase original amount

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

Math for Liberal Studies

Economics 470 Some Notes on Simple Alternatives to Majority Rule

The Math of Rational Choice - Math 100 Spring 2015

Mathematical Thinking. Chapter 9 Voting Systems

Voting: Issues, Problems, and Systems, Continued

MATH 1340 Mathematics & Politics

Mathematics of Voting Systems. Tanya Leise Mathematics & Statistics Amherst College

: It is mathematically impossible for a democratic voting method to satisfy all of the fairness criteria was proven in 1949.

Voting. Hannu Nurmi. Game Theory and Models of Voting. Public Choice Research Centre and Department of Political Science University of Turku

Voting Criteria April

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Rock the Vote or Vote The Rock

Public Choice. Slide 1

Four Condorcet-Hare Hybrid Methods for Single-Winner Elections

Random tie-breaking in STV

The Mathematics of Voting. The Mathematics of Voting

Intro to Contemporary Math

Syllabus update: Now keeping best 3 of 4 tests

Find the winner of the election using majority rule given the results below: Choices (ABC) (ACB) (BAC) (BCA) (CAB) (CBA) Number of Votes

Sect 13.2 Flaws of Voting Methods

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Math116Chap1VotingPart2.notebook January 12, Part II. Other Methods of Voting and Other "Fairness Criteria"

In deciding upon a winner, there is always one main goal: to reflect the preferences of the people in the most fair way possible.

A fair three-option referendum? Denis Mollison (Heriot-Watt University)

The search for a perfect voting system. MATH 105: Contemporary Mathematics. University of Louisville. October 31, 2017

Voting: Issues, Problems, and Systems. Voting I 1/36

Voting: Issues, Problems, and Systems, Continued. Voting II 1/27

Name Date I. Consider the preference schedule in an election with 5 candidates.

Voting Systems That Combine Approval and Preference

Today s plan: Section : Plurality with Elimination Method and a second Fairness Criterion: The Monotocity Criterion.

In this lecture we will cover the following voting methods and fairness criterion.

Voting Methods

Vote for Best Candy...

Warm-up Day 3 Given these preference schedules, identify the Plurality, Borda, Runoff, Sequential Runoff, and Condorcet winners.

Voting: Issues, Problems, and Systems. Voting I 1/31

Safe Votes, Sincere Votes, and Strategizing

Single-winner Voting Method Comparison Chart

Make the Math Club Great Again! The Mathematics of Democratic Voting

2-Candidate Voting Method: Majority Rule

Chapter 10. The Manipulability of Voting Systems. For All Practical Purposes: Effective Teaching. Chapter Briefing

SOCIAL CHOICES (Voting Methods) THE PROBLEM. Social Choice and Voting. Terminologies

The mathematics of voting, power, and sharing Part 1

Voting and preference aggregation

Fair-Share Voting. Proposing a New Voting Method For Participatory Budgeting. Robert Tupelo-Schneck

Voting: Issues, Problems, and Systems

PROBLEM SET #2: VOTING RULES

Social Choice. CSC304 Lecture 21 November 28, Allan Borodin Adapted from Craig Boutilier s slides

Voting Definitions and Theorems Spring Dr. Martin Montgomery Office: POT 761

Voting Systems. High School Circle I. June 4, 2017

Plurality voting system

Rationality of Voting and Voting Systems: Lecture II

Math for Liberal Arts MAT 110: Chapter 12 Notes

A New Method of the Single Transferable Vote and its Axiomatic Justification

Introduction to Social Choice

The UK General Election 2017

Voting Lecture 3: 2-Candidate Voting Spring Morgan Schreffler Office: POT Teaching.

Social Choice & Mechanism Design

Voting and preference aggregation

Kybernetika. Robert Bystrický Different approaches to weighted voting systems based on preferential positions

In deciding upon a winner, there is always one main goal: to reflect the preferences of the people in the most fair way possible.

Electing the President. Chapter 12 Mathematical Modeling

Voting Methods for Municipal Elections: Propaganda, Field Experiments and what USA voters want from an Election Algorithm

Possible voting reforms in the United States

Chapter 9: Social Choice: The Impossible Dream

The Manipulability of Voting Systems. Check off these skills when you feel that you have mastered them.

Majority- more than half of the votes Plurality- the most first place votes. The Majority Criterion

Warm-up Day 3. Phones OFF and in pockets! 1) Given these preference schedules, identify the Condorcet, Runoff, and Sequential Runoff winners.

Fair Division in Theory and Practice

1.1 The Basic Elements of an Election 1.2 The Plurality Method

Algorithms, Games, and Networks February 7, Lecture 8

Transcription:

Association Française pour le Nommage Internet en Coopération Election methods Olivier.Guillard@afnic.fr Election method for ccnso 1 Icann Carthage 28th October 2003

Election Methods Evaluation Setting up an election means setting up a voting procedure and choosing a set of mathematical rules to count the ballots and determine the winner(s). This presentation will focus on objective technical criteria to help choosing the set of rules for counting the ballots and determining the winner, and will propose a concrete method (draft) based on approval ; Election method for ccnso 2 Icann Carthage 28th October 2003

Why do we care? an easy example (1) The best election method gives the electorate the possibility to vote for the leaders they sincerely prefer and minimize their need to vote strategically; Example: the conventional plurality system strengthens the bipolarity vision of political sensitivity and render almost impossible for little parties to have representatives elected : electors are pushed to vote for the stronger less evil because voting for the one they prefer might strengthen the one they don t want! Election method for ccnso 3 Icann Carthage 28th October 2003

Favorite Betrayal Criterion Statement of Criteria: an easy example (2) No voter should ever have strategic incentive to vote a lessliked candidate over his favorite. A better election method should comply with Favorite Betrayal Criterion. The conventional plurality and STV does not comply with this criterion Condorcet Method and Approval method comply with this criterion Election method for ccnso 4 Icann Carthage 28th October 2003

Defensive Strategy Criterion Statement of Criteria: an easy example (2) If a majority prefers one particular candidate to another, then they should have a way of voting that will ensure that the other cannot win, without any member of that majority reversing a preference for one candidate over another. A good election method should comply with defensive strategy criterion. The conventional plurality and STV does not comply with this criterion Condorcet Method and Approval method comply with this criterion Election method for ccnso 5 Icann Carthage 28th October 2003

Why do we care? A «bizarre» example with STV (1) 7 ballots : A,B,C,D - 6 ballots : B,A,C,D - 5 ballots : C,B,A,D - 3 ballots : D,C,B,A We count the number of time each candidate is supported as first : A : 7, B : 6, C : 5, D : 3 If one candidate receives a majority of first choice, this one wins (not in that case) Eliminate the one less supported (D in this case) and reapply the method: 7 ballots :A,B,C - 6 ballots :B,A,C - 5 ballots : C,B,A - 3 ballots : C,B,A A : 7, B : 6, C : 8 B is eliminated 7 ballots : A,C - 6 ballots :A,C - 5 ballots : C,A - 3 ballots : C,A A : 11, C : 8 A IS THE WINNER!!! Election method for ccnso 6 Icann Carthage 28th October 2003

Why to care? A «bizarre» example with STV (1) Suppose that instead of: 7 ballots : A,B,C,D - 6 ballots : B,A,C,D - 5 ballots : C,B,A,D - 3 ballots : D,C,B,A The 3 last voters promoted A. The count is : 7 ballots : A,B,C,D - 6 ballots : B,A,C,D - 5 ballots : C,B,A,D - 3 ballots : A,D,C,B The count is: A : 10, B : 6, C : 5 No candidate has the majority, D and C eliminated the method is reapplied on: 7 ballots : A,B - 6 ballots : B,A - 5 ballots : B,A - 3 ballots : A,B A : 10, B : 11 B IS THE WINNER!!! By supporting A from last to first choice, 3 voters caused A to lose instead of win Election method for ccnso 7 Icann Carthage 28th October 2003

Monotonicity Criterion Statement of Criterion: With the relative order or rating of the other candidates unchanged, voting a candidate higher should never cause the supported candidate to lose, nor should voting a unsupported candidate ever cause the candidate to win. A good election method should comply with Monotonicity Criterion. The STV method does not comply with this criterion. Election method for ccnso 8 Icann Carthage 28th October 2003

Some Technical Criteria Monotonicity Criterion (MC) Condorcet Criterion (CC) Generalized Condorcet Criterion (GCC) Strategy-Free Criterion (SFC) Generalized Strategy-Free Criterion (GSFC) Strong Defensive Strategy Criterion (SDSC) Weak Defensive Strategy Criterion (WDSC) Favorite Betrayal Criterion (FBC) Summability Criterion (SC) see the evaluation methods matrix: http://www.electionmethods.org/evaluation.htm Election method for ccnso 9 Icann Carthage 28th October 2003

Suggestions The method that complies with almost all criteria used to evaluate election methods is condorcet method ; Some online communities use this method (debian, etc.); Issues : it s a ranking method, more complex to be implemented, difficult to understand by the electorate; The calculation is done by counting how many times each candidate would win on a face to face fight against each other candidate (with three sits the combination issue is quite complex). Approval method: an alternative! Election method for ccnso 10 Icann Carthage 28th October 2003

Approval method Approval method complies with many evaluation criteria; In Approval voting, each voter simply votes for (or approves), as many of the candidates he desires; Approved candidates are simply marked not ranked ; As in plurality voting, the votes are counted, and the candidate with the most votes wins; In the ccnso context, the "vote for three candidates" assumption (that would be used with a traditional plurality voting process) would simply become "vote for as many candidates". Election method for ccnso 11 Icann Carthage 28th October 2003

Election statement proposal with Approval for the ccnso Each voter checks as many candidates he/she wants; The winners are the three candidates with the most checks; If two or more candidates are tied for one or more sits, hold a second election between the tied candidates for the seat(s) they are tied for; The winner that has the most checks is elected for three years, the second for two years, the third for one year; In case of winner tied within the winner set, organize a straw poll within this set to determine who is first second and third; Election method for ccnso 12 Icann Carthage 28th October 2003

THANKS! Thanks to Mike Ossipoff and Jean-Sébastien Lebacq : http://www.electionmethods.org Emmanuel Raviart and Patrice Saad : http://www.entrouvert.com http://www.condorcet.org Election method for ccnso 13 Icann Carthage 28th October 2003