Homework Read Pages 6 – 23 Page 30: 18, 19, 24, 28, 29, 30, 33, 59, 60, 71.

Slides:



Advertisements
Similar presentations
Voting Methods Continued
Advertisements

Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
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.
 1. The majority criterion  2. Condorcet’s criterion  3. independence of irrelevant alternatives criterion  4. Monotonicity criterion.
MA 110: Finite Math Dr. Maria Byrne Instructional Laboratory 0345 Lecture 10/31/2008.
Social Choice: The Impossible Dream Michelle Blessing February 23, 2010 Michelle Blessing February 23, 2010.
Excursions in Modern Mathematics Sixth Edition
The Plurality Method The Borda Count Method
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.
Math for Liberal Studies.  There are many more methods for determining the winner of an election with more than two candidates  We will only discuss.
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.
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.2, Slide 1 11 Voting Using Mathematics to Make Choices.
§ 1.5 The Method of Pairwise Comparisons (Copeland’s Method)
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting The Paradoxes of Democracy Vote! In.
Arrow’s Theorem The search for the perfect election decision procedure.
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.
May 19, 2010Math 132: Foundations of Mathematics 12.5 Homework Solutions 27. (a) 28. (b) 29. (d) 30. (e) 53. Positive Correlation, Weak 54. Negative Correlation,
1 Voting: Perception and Reality Do voters vote in their best interest? When they do, does the outcome of the vote reflect those interests? What type of.
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,
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.1, Slide 1 11 Voting Using Mathematics to Make Choices.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
Voting Tie Breakers. With each method described – plurality method, Borda count method, plurality with elimination method, and pairwise comparison method.
Part 4: Voting Topics - Continued
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.
How Should Presidents Be Elected? E. Maskin Institute for Advanced Study.
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.
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,
Fairness Criteria Fairness Criteria: properties we expect a good voting system to satisfy.Fairness Criteria: properties we expect a good voting system.
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 and Apportionment
Plurality and Borda Count Method
1 The Mathematics of Voting
1.
Plurality with elimination, Runoff method, Condorcet criterion
8.2 Voting Possibilities and Fairness Criteria
1.3 The Borda Count Method.
Warm Up – 5/27 - Monday How many people voted in the election?
Warm Up – 1/23 - Thursday How many people voted in the election?
Social Choice Theory [Election Theory]
Classwork: p.33 (27abc run off, 29ab run off, 31, 33ab run off)
Section 15.2 Flaws of Voting
5-2 Election Theory Flaws of Voting.
Voting systems Chi-Kwong Li.
The Mathematics of Elections
Warm Up – 1/27 - Monday Who wins by Plurality with Elimination?
Voting Pairwise Comparison.
Quiz – 1/24 - Friday How many people voted in the election?
Section 14.1 Voting Methods.
Flaws of the Voting Methods
Voting Fairness.
Presentation transcript:

Homework Read Pages 6 – 23 Page 30: 18, 19, 24, 28, 29, 30, 33, 59, 60, 71

Office hours Wednesday 1/2410:00 – 11:00 12:00 – 1:00 1:00 – 2:30 Thursday 1/2510:00 – 11:00 11:00 – 12:00

Core 120 Math lab The mathematics help lab provides students the opportunity to receive assistance toward understanding the topics presented in their Core 120 or class. The lab will give students the chance to ask questions from their class notes or text, and then reinforce their understanding of these topics by working on related problems from the text. The lab will also provide assistance in comprehending and working homework exercises that have been previously attempted by the student. Any student who has questions in these classes is invited to attend for any part of the times listed below. All help will be provided in small group sessions on a walk-in basis. Topics will be covered at a first come first serve basis, with the depth of each topic depending on the number of questions asked. Instruction and assistance in the lab will be provided by Marc Evans, King’s College Mathematics Specialist. Core 120 – Quantitative Reasoning Reinforcement Lab –Mondays6:00 – 7:30 pmAdministration 426 –Thursdays4:00 – 5:30 pmAdministration 426

Put problems that we will look at up on board Which problems did the group have difficulty with Pick groups to put up 19a, 29 Discuss 19, 24, 29, 59

Which methods satisfy which criterion? YN N N N N N Y

The Condorcet Criterion (page 8) - If there is a choice that in a head-to-head comparison is preferred by the voters over every other choice, then that choice should be the winner of the election.

IV.THE METHOD OF PAIRWISE COMPARISONS TABLE 1-11

TABLE 1-12

IV.THE METHOD OF PAIRWISE COMPARISONS (page 17) Each candidate is matched one-on-one with with every other candidate. Each of these one-on-one matchups is called a pairwise comparison. In a pairwise comparison between candidates X and Y each vote is assigned to either X or Y, the vote going to whichever of the candidates is higher on the ballot. The winner of the pairwise comparison is the one with the most votes and a win is worth one point. In case of a tie each candidate gets 1/2 point. The winner of the election is the candidate with the most points after all of the pairwise comparisons are tabulated. In the case of a tie we can have more than one winner or use a predetermined tie-breaking procedure.

IV.THE METHOD OF PAIRWISE COMPARISONS TABLE 1-11

Objective 4: Synthesizing results from previous discoveries to create new ideas

Winner MASVoting Method AlishaPlurality BorisBorda Count DavePlurality-with-elimination CarmenPairwise comparisons MATHEMATICS APPRECIATION SOCIETY FINAL RESULTS What’s wrong with the method of pairwise comparisons?

A vs B: 7 votes to 15 votes. B gets 1 point A vs C: 16 votes to 6 votes. A gets 1 point A vs D: 13 votes to 9 votes. A gets 1 point A vs E: 18 votes to 4 votes. A gets 1 point B vs C: 10 votes to 12 votes. C gets 1 point B vs D: 11 votes to 11 votes. B gets.5 point, D gets.5 point B vs E: 14 votes to 8 votes. B gets 1 point C vs D: 12 votes to 10 votes. C gets 1 point C vs E: 10 votes to 12 votes. E gets 1 point D vs E: 18 votes to 14 votes. D gets 1 point FINAL TALLY A-3 B-2.5 C-2 D-1.5 E-1 Winner is A. Example LA Laxers Draft Choices (page 19) TABLE 1-13

A vs B: 7 votes to 15 votes. B gets 1 point A vs D: 13 votes to 9 votes. A gets 1 point A vs E: 18 votes to 4 votes. A gets 1 point B vs D: 11 votes to 11 votes. B gets.5 point, D gets.5 point B vs E: 14 votes to 8 votes. B gets 1 point D vs E: 18 votes to 14 votes. D gets 1 point FINAL TALLY A-2 B-2.5 D-1.5 E-0 Winner is B. TABLE 1-14

The Independence-of-Irrelevant-Alternatives Criterion. If choice X is a winner of an election and one (or more) of the other choices is removed and the ballots recounted, then X should still be a winner of the election. The method of pairwise comparisons violates the independence-of-alternatives criterion. 4 th criteria for a fair election:

Which methods satisfy which criterion? YN N N N N N YN

The method of pairwise comparisons may end in a tie. What else is wrong with the method of pairwise comparisons? H vs P: 9 votes to 2 votes. H gets 1 point P vs D: 6 votes to 5 votes. P gets 1 point D vs H: 7 votes to 4 votes. D gets 1 point FINAL TALLY H-1 P-1 D-1 Tie. Winner is ? Example Hockey Team Dinner Preferences TABLE 1-15

NFL tiebreakers

With N candidates there are : …+(N-3)+(N-2)+(N-1)= How many pairwise comparisons?

Homework Read Pages , 42 – 46 Page 35: 35, 38, 63, 64