Homework Discussion Read Pages 48 – 62 Page 72: 1 – 4, 6 TEST 1 ON THURSDAY FEBRUARY 8 –The test will cover sections 1.1 – 1.6, and 2.1 – 2.3 in the textbook.

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

Chapter 2: Weighted Voting Systems
MAT 105 Spring  In many voting systems, the voters are not treated equally  Juries: If one voter votes “not guilty,” then the result is “not guilty”
Weighted Voting When we try to make collective decisions, it is only natural to consider how things are done in society. We are familiar with voting for.
Chapter 11: Weighted Voting Systems Lesson Plan
Presented by: Katherine Goulde
Voting and social choice Vincent Conitzer
Math for Liberal Studies.  In many voting systems, the voters are not treated equally  Juries: If one voter votes “not guilty,” then the result is “not.
DM.8. Is a set of numbers that are listed in the following format: [ quota: weight of voter 1, weight of voter 2,…weight of voter 3] Ex: [8:5,4,3,2]
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.
§ The Banzhaf Power Index
Excursions in Modern Mathematics Sixth Edition
Excursions in Modern Mathematics Sixth Edition
What is your favorite food?. Preference Schedule A Preference Schedule is a way to represent the order in which people like (prefer) certain items. The.
Annexations and Merging in Weighted Voting Games: The Extent of Susceptibility of Power Indices by Ramoni Lasisi Vicki Allan.
CPS Voting and social choice
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
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.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 2 The Mathematics of Power 2.1An Introduction to Weighted Voting.
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.
Chapter 13: Weighted Voting Banzhaf Power Index Shapley-Shubik Power Index Equivalent Systems Examples.
CPS Voting and social choice Vincent Conitzer
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.
Chapter 13 – Weighted Voting Lecture Part 2. Chapter 13 – Lecture Part 2 The Banzhaf Power Index –Counting the number of subsets of a set –Listing winning.
Weighted Voting Systems
Chapter 15 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 2 The Mathematics of Power 2.1An Introduction to Weighted Voting.
Weighted Voting Problems. Problem 1 1. The disciplinary board at PU is composed of 5 members, two of whom must be faculty and three of whom must be students.
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.2 Flaws of Voting.
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.3, Slide 1 11 Voting Using Mathematics to Make Choices.
Chapter 11. Weighted Voting Systems  Goals Study weighted voting systems ○ Coalitions ○ Dummies and dictators ○ Veto power Study the Banzhaf power index.
Weighted Voting Systems Chapter 2 Objective: Calculate the Banzhaf power Index for a weighted voting system. Learn additional notation and terminology.
Fairness Criteria Fairness Criteria: properties we expect a good voting system to satisfy.Fairness Criteria: properties we expect a good voting system.
Voting System Review Borda – Sequential Run-Off – Run-Off –
Weighted Voting Systems Chapter 2 Objective: Recognize the notation for weighted voting system and be able to define quota, player, dictator, dummy and.
EXCURSIONS IN MODERN MATHEMATICS SIXTH EDITION Peter Tannenbaum 1.
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
The Banzhaf Power Index
Excursions in Modern Mathematics Sixth Edition
Chapter 11: Weighted Voting Systems Lesson Plan
1.
1.5 Weighted Voting and Voting Power
Introduction to Social Choice
8.2 Voting Possibilities and Fairness Criteria
Excursions in Modern Mathematics Sixth Edition
Warm Up – 5/27 - Monday How many people voted in the election?
Warm Up – 1/23 - Thursday How many people voted in the election?
Section 15.2 Flaws of Voting
5-2 Election Theory Flaws of Voting.
Chapter 11: Weighted Voting Systems
Voting and social choice
Introduction to Social Choice
Weighted Voting.
Homework Collection Homework Discussion Page 35: 35, 38, 63, 64
Chapter 11: Weighted Voting Systems Lesson Plan
The Banzhaf Power Index
Warm Up – 1/27 - Monday Who wins by Plurality with Elimination?
Quiz – 1/24 - Friday How many people voted in the election?
Discrete Math Weighted Voting.
Flaws of the Voting Methods
CPS Voting and social choice
Voting Fairness.
Presentation transcript:

Homework Discussion Read Pages 48 – 62 Page 72: 1 – 4, 6 TEST 1 ON THURSDAY FEBRUARY 8 –The test will cover sections 1.1 – 1.6, and 2.1 – 2.3 in the textbook as well as any other items covered in the class notes and homework assignments.

describes a weighted voting system where q is the quota and are the respective votes of the players. The weights are normally written in numerical order from the highest to the lowest. Example 1. Chapter 2: Weighted Voting Goal: Construct an algorithm to determine the “power” of each player.

coalition - Any set of players that might join forces to vote together is called a coalition. (single player coalitions are allowed) weight of the coalition - The total number of votes controlled by a coalition is called the weight of the coalition. A coalition with enough votes to win is called a winning coalition. A coalition without enough votes to win is called a losing coalition. The coalition consisting of all the players is called the grand coalition. Definitions (page 54)

critical player - A player whose desertion turns a winning coalition into a losing coalition is said to be a critical player for that coalition.

FINDING THE BANZHAF POWER INDEX OF PLAYER P Step 1. Make a list of all possible coalitions. Step 2. Determine which of them are winning coalitions. Step 3. In each of the winning coalitions, determine which of the players are critical players. Step 4. Count the total number of times player P is critical. (Let’s call this number B.). Step 5. Count the total number of times all players are critical. (Let’s call this number T.) The Banzhaf power index of player P is B/T. It represents the proportion of times that player P is critical out of all the times that players are critical. Page 56

Objective 6: Constructing and applying algorithms

Example: [4:3,2,1]

Example. [101:99,98,3]

Example. [6:4,3,2,1]

Example 6. dictator - a player is a dictator if the player’s weight is bigger than or equal to the quota. veto power - A player that is not a dictator, but that can single-handedly prevent the rest of the players from passing a motion, is said to have veto power. dummy - a player without power is called a dummy. Example 7.

Nassau County Board of Supervisors in 1960: Quota is the majority of votes DistrictWeight Hemstead #131 Hemstead #231 Oyster Bay28 North Hempstead 21 Long Beach2 Glen Cove2

Homework Page 72: 11, 14, 17, 20, 55a, 56a, 66a TEST 1 ON THURSDAY FEBRUARY 8 –The test will cover sections 1.1 – 1.6, and 2.1 – 2.3 in the textbook as well as any other items covered in the class notes and homework assignments.

Test Information Textbook sections: 1.1 – 1.6 Aarow’s Impossibility Theorem Preference Schedules Voting Methods –Plurality –Borda Count –Plurality with Elimination –Pairwise Comparison Extended Rankings Recursive Rankings Criterion for a fair election –Majority Criteria –Condorcet Criteria –Monotonicity Criteria –Independence of Irrelevant Alternative Criteria

Test Information Textbook sections: 2.1 – 2.3 Players, Weights, Quota, Coalitions, Critical Player in winning coalitions Dictator, Veto Power, Dummy, Banzhaf Power Index