Voting and Math Kelsey, Ashleigh, Alex, Nick, Justin MAT 142 Final Project.

Slides:



Advertisements
Similar presentations
Which units are you most interested in covering? Unit A –Management Science Unit B – Growth Unit C – Shape and Form Unit D – Statistics.
Advertisements

Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Voting Methods Continued
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
The Voting Problem: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
2 systems of voting : Plurality and Proportional representation systems BY: Destiny Cook, Jordan Burke.
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
Chapter 1: Methods of Voting
The Mathematics of Elections
Mathematics The study of symbols, shapes, algorithms, sets, and patterns, using logical reasoning and quantitative calculation. Quantitative Reasoning:
VOTING SYSTEMS Section 2.5.
Math for Liberal Studies.  We have studied the plurality and Condorcet methods so far  In this method, once again voters will be allowed to express.
Math for Liberal Studies.  In most US elections, voters can only cast a single ballot for the candidate he or she likes the best  However, most voters.
MAT 105 Spring  There are many more methods for determining the winner of an election with more than two candidates  We will only discuss a few.
Excursions in Modern Mathematics Sixth Edition
MAT 105 Spring  As we have discussed, when there are only two candidates in an election, deciding the winner is easy  May’s Theorem states that.
1.1, 1.2 Ballots and Plurality Method
Fair Elections Are they possible?. Acknowledgment Many of the examples are taken from Excursions in Modern Mathematics by Peter Tannenbaum and Robert.
CRITERIA FOR A FAIR ELECTION
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
Social choice (voting) Vincent Conitzer > > > >
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.2, Slide 1 11 Voting Using Mathematics to Make Choices.
Choice Voting- Proportional Representation
Social Choice Lecture 19 John Hey.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting The Paradoxes of Democracy Vote! In.
Slide 15-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Copyright © 2009 Pearson Education, Inc. Chapter 15 Section 2 - Slide Election Theory Flaws of Voting.
Ch Voting Preference tables E, F, G, and H are running for math club president If everyone is asked to rank their preferences, how many different.
The Mathematics of Voting Chapter 1. Voting theory: application of methods that affect the outcome of an election. Sec 1: Preference Ballots and Schedules.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 14 Voting and Apportionment.
Chapter 15 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Math for Liberal Studies.  We have seen many methods, all of them flawed in some way  Which method should we use?  Maybe we shouldn’t use any of them,
Let’s take a class vote. How many of you are registered to vote?
Voting Methods Examples of Voting Methods (other than majority rules) –Plurality –Borda Count –Hare System –Sequential Pairwise –Approval Voting.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
Why We Should Use the Plurality with Elimination Voting Method.
Warm-Up Rank the following soft drinks according to your preference (1 being the soft drink you like best and 4 being the one you like least)  Dr. Pepper.
The Mathematics of Voting Chapter 1. Preference Ballot A Ballot in which the voters are asked to rank the candidates in order of preference. 1. Brownies.
© 2010 Pearson Prentice Hall. All rights reserved Flaws of Voting Methods.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.2 Flaws of Voting.
14.2 Homework Solutions Plurality: Musical play Borda count: Classical play Plurality-with-elimination: Classical play Pairwise Comparison: Classical play.
The mathematics of voting The paradoxes of democracy.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan Voting and Social Choice Majority Rule and Condorcet’s Method Other Voting Systems for Three.
Excursions in Modern Mathematics, 7e: 1.Conclusion - 2Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting CONCLUSION Elections, Fairness,
My guy lost? What’s up with that….  In the 1950’s, Kenneth Arrow, a mathematical economist, proved that a method for determining election results that.
1.
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
Voting: Does the Majority Always Rule?
Voting and Apportionment
1 The Mathematics of Voting
1.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
8.2 Voting Possibilities and Fairness Criteria
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1.3 The Borda Count Method.
Elections with More Than Two Candidates
Section 15.2 Flaws of Voting
5-2 Election Theory Flaws of Voting.
Voting systems Chi-Kwong Li.
Voting Preference Ballots and Preference Schedules
Warm Up – 1/27 - Monday Who wins by Plurality with Elimination?
Quiz – 1/24 - Friday How many people voted in the election?
Section 14.1 Voting Methods.
Flaws of the Voting Methods
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

Voting and Math Kelsey, Ashleigh, Alex, Nick, Justin MAT 142 Final Project

Table of Contents Vocab Types of Voting ▫Borda Count ▫Pairwise Comparison ▫Proxy Voting ▫Delegated Voting

Vocab Voter Preference Tables: These types of tables list different rankings of the candidates along with the number of voters who chose each specific ranking. They are often used to depict the voting patterns in a ranked election. Notice that the preference schedule compactly summarizes the votes in the election by grouping identical preference ballots together along with a count of how many voters cast each identical preference ballot. From the perspective of the instant runoff method, which is when voters rank the candidates in order of preference and their ballots are counted as one vote for their first choice candidate, we can conclude that the winner would be [w] because you can add the number of ballots cast for first choice W, and see that there are 23 people who ranked was first choice, whereas the other would be 19 and 18. With the Borda Count Method, which is a single-winner election method in which voters rank candidates in order of preference, B would be the winner. You can find that out by doing the math, the total points would be W=112, P=123, and B=125. ExNumber of Ballots Cast st Choice wwppbb 2 nd Choice pbbwwp 3 rd Choice bpwbpw

Vocab Cont. The Majority Criterion This is when a single-winner voting system criterion is used to compare systems. The criterion states that if one candidate is preferred by a majority (more than 50%) of voters, then that candidate must win. This is similar to the instant runoff method. If candidate X receives a majority of the votes, then candidate X should be declared the winner. The Head-to-Head Criterion If candidate X is favored when compared head-to-head (individually) with each of the other candidates, then candidate X should be declared the winner. You’re competing head-to-head with candidate A and you win; then you go head-to-head with candidate B and also win. The fair and logical conclusion would be that you beat both so you should be the overall winner.

Vocab Cont. The Monotonicity Criterion If candidate X wins an election, and in a subsequent election, the only changes are changes in favor of candidate X, then candidate X should be declared the winner. Arrow’s Impossibility Theorem It is mathematically impossible to create any system of voting, involving three or more candidates that satisfies all four fairness criteria. This theorem states that, when voters have three or more distinct alternatives options, no voting system can convert the ranked preferences of individuals into a community-wide (complete and transitive) ranking while also meeting a specific set of criteria.

Borda Count Each voter ranks all of the candidates. If there are k candidates each candidate receives k points for each first-choice vote, (k-1) points for each second-choice vote, (k-2) points for each third- choice vote, and so on. The candidate with the most total points is declared the winner. Borda Count is currently used for the election of two ethnic minority members of the National Assembly of Slovenia, and, in modified forms, to select presidential election candidates in Kiribati and to elect members of the Parliament of Nauru. It is also used throughout the world by various private organizations and competitions. The Borda count is classified as a positional voting system because each rank on the ballot is worth a certain number of points. Other positional methods include first-past-the-post (plurality) voting. References Wikipedia

Borda Count Cont. # ofVoters Place stPTTS 2ndRRRR 3rdSSPP 4thTPST There is a formula that you can use it takes awhile but this is the main formula for it: 4( )+3( )+2( )+1( )= ? You do this for each person in the race. Paul:1140 Rita:1500 Sarah:1200 Tim:1160

Pairwise Comparison Wikipedia: generally refers to any process of comparing entities in pairs to judge which of each pair is preferred, or has a greater amount of some quantitative property Book definition: Each voter ranks all of the candidates. For each possible pairing of candidates, the candidate with the most votes receives 1 point; if there is a tie, each candidate receives ½ point. The candidate who receives the most points is declared the winner. Simple Definition: The most random method of voting, that actually makes sense...

Pairwise Comparison Cont. Most commonly used for the Analytical Hierarchy Process, “a structured technique for helping people deal with complex decisions.

Proxy Voting Proxy voting is a procedure that allows one person to authorize someone else to vote on his behalf. It is most commonly used by lawmakers in the legislative process, in elections, and in corporate shareholder meetings. Proxy voting is recognized under a number of popular rules of order, including Riddick's Rules of Parliamentary Procedure™, but is prohibited under others, such as The Standard Code of Parliamentary Procedure™. Such rules are normally adopted by an organization at its inception. One receive a proxy ballot in the mail along with an informational booklet called a proxy statement describing the issues to be voted on. They return a form by mail agreeing to have their vote cast by proxy. Issues commonly decided by proxy vote include electing directors to the board, approving a merger or acquisition, and approving a stock compensation plan. In elected government, proxy voting is often employed in the committee process, to allow legislators to vote on bills and resolutions in absentia. Though specific rules often vary among governments and committees, generally, a legislator who expects to miss a committee vote must submit his proxy vote to the chairman or committee staff, in writing, prior to the vote taking place. A proxy vote does not count towards a committee's quorum, so there must be enough members present to establish a quorum before any proxy votes on a given question can be counted.

Delegated Voting In delegated voting, the proxy is transitive and the transfer is recursive. Put simply, the vote can be further delegated to the proxy's proxy, and so on. This process is also known as transitive voting, delegable proxy, and asset voting, Liquid Democracy and Augmented Democracy.

Delegated Voting Cont. An early proposal of delegate voting was that of Lewis Carroll in More recent proposals are by Mikael Nordfors, Bryan Ford, James Green-Armytage and Michael Allan. Delegate voting is used by the Swedish local political party Demoex. Demoex won their first seat in the city council of Vallentuna, Sweden, in The first years of activity in the party have been evaluated by Mitthögskolan University in a paper by Karin Ottesen in 2003 In Demoex, a voter can also vote directly, even if she has delegated her vote to a proxy; the direct vote overrules the proxy vote. It is also possible to change the proxy at any time.