Weighted Voting, Algorithms and Voting Power

Slides:



Advertisements
Similar presentations
Chapter 11: Weighted Voting Systems Lesson Plan
Advertisements

Chapter 2: Weighted Voting Systems
How are the number of seats per state assigned by the Constitution?
Fair Division Estate Division.
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
Chapter 13 – Weighted Voting Part 4 Appropriate applications of measures of power Minimal winning coalitions Classification of weighted voting systems.
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]
Copyright © Cengage Learning. All rights reserved. 6 Equations and Formulas.
1 Message to the user... The most effective way to use a PowerPoint slide show is to go to “SLIDE SHOW” on the top of the toolbar, and choose “VIEW SHOW”
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.
§ 2.1 Weighted Voting Systems. Weighted Voting  So far we have discussed voting methods in which every individual’s vote is considered equal--these methods.
This material in not in your text (except as exercises) Sequence Comparisons –Problems in molecular biology involve finding the minimum number of edit.
ALGEBRA, EQUATIONS AND FORMULAE. INTRODUCTION  Algebra essentially involves the substitution of letters for numbers in calculations, so that we can establish.
Review for Final Exam Systems of Equations.
A SEARCH-BASED APPROACH TO ANNEXATION AND MERGING IN WEIGHTED VOTING GAMES Ramoni Lasisi and Vicki Allan Utah State University by.
Chapter 13: Weighted Voting Banzhaf Power Index Shapley-Shubik Power Index Equivalent Systems Examples.
Weighted Voting Systems Brian Carrico. What is a weighted voting system?  A weighted voting system is a decision making procedure in which the participants.
Copyright © Cengage Learning. All rights reserved. Elementary Probability Theory 5.
A small country has 4 provinces – A, B, C and D. Each province contains 30%, 20%, 10% and 40% of the population in the country, respectively. The.
Other Apportionment Algorithms and Paradoxes. NC Standard Course of Study Competency Goal 2: The learner will analyze data and apply probability concepts.
Copyright © Cengage Learning. All rights reserved. 4 Quadratic Functions.
Equations, Inequalities, and Mathematical Models 1.2 Linear Equations
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 2.1.
Math for Liberal Studies.  We want to measure the influence each voter has  As we have seen, the number of votes you have doesn’t always reflect how.
1 Tests of Significance In this section we deal with two tests used for comparing two analytical methods, one is a new or proposed method and the other.
Weighted Voting Systems
Manipulating the Quota in Weighted Voting Games (M. Zuckerman, P. Faliszewski, Y. Bachrach, and E. Elkind) ‏ Presented by: Sen Li Software Technologies.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 2 The Mathematics of Power 2.1An Introduction to Weighted Voting.
CPSC 252 Hashing Page 1 Hashing We have already seen that we can search for a key item in an array using either linear or binary search. It would be better.
1. solve equations with variables on both sides. 2. solve equations containing grouping symbols. Objectives The student will be able to:
Copyright © Cengage Learning. All rights reserved. Systems of Linear Equations and Inequalities in Two Variables 7.
CHAPTER THREE REVIEW. QUESTION ONE SOLVE THE SYSTEM.
1. solve equations with variables on both sides. 2. solve equations with either infinite solutions or no solution Objectives The student will be able to:
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 7.2 Counting Our.
Fair Division Algorithms
Lesson  Shown at the right are the first six rows of Pascal’s triangle.  It contains many different patterns that have been studied for centuries.
Apportionment There are two critical elements in the dictionary definition of the word apportion : (1) We are dividing and assigning things, and (2) we.
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.
Continue the sequence 1. ½, 1, 2, 4, 8, __, __, __ 2. __, 5, 9, 13, __, __, , 55, __, 15, __, __ 4. 8, 27, 103, __ 5 Minutes Remain.
Solving Equations with Variables on Both Sides. Review O Suppose you want to solve -4m m = -3 What would you do as your first step? Explain.
Complex Numbers and Equation Solving 1. Simple Equations 2. Compound Equations 3. Systems of Equations 4. Quadratic Equations 5. Determining Quadratic.
Chapter 3 Systems of Equations. Solving Systems of Linear Equations by Graphing.
EXCURSIONS IN MODERN MATHEMATICS SIXTH EDITION Peter Tannenbaum 1.
The Banzhaf Power Index
What is Fair? 1.) Martha and Ray want to divide the last piece of cake their mother baked last night. Propose a method for dividing the piece of cake.
Excursions in Modern Mathematics Sixth Edition
Chapter 11: Weighted Voting Systems Lesson Plan
4 Elementary Probability Theory
Multi-Step Equations How to Identify Multistep Equations |Combining Terms| How to Solve Multistep Equations | Consecutive Integers.
1.5 Weighted Voting and Voting Power
Module 6 Writing and Solving Two Step Equations
4 Elementary Probability Theory
Excursions in Modern Mathematics Sixth Edition
Chapter 11: Weighted Voting Systems
What is Fair? 1.) Martha and Ray want to divide the last piece of cake their mother baked last night. Propose a method for dividing the piece of cake.
1.5 – Weighted Voting and Voting Power
Designing Samples Section 5.1.
Algebra
Using the Addition and Multiplication Principles Together
Weighted Voting.
Chapter 11: Weighted Voting Systems Lesson Plan
The Banzhaf Power Index
Discrete Math Weighted Voting.
Presentation transcript:

Weighted Voting, Algorithms and Voting Power

Student Council A small high school has 110 students. The school's student council is composed of a single representative from each class, sophomore, junior and senior. The class populations are 50 sophomores, 30 juniors and 30 seniors. Each of the three members is given a number of votes proportionate to the size of the class represented.

Student Council (cont'd) Therefore, the sophomore class has five votes, and the junior and senior classes each have three. In order for any issue to pass the council, a simple majority of six votes is required. This procedure is an example of weighted voting. WEIGHTED VOTING occurs whenever some members of the voting body have more votes than others do.

Ways of Passing an Issue Issues facing this board can be passed by having either the sophomore and junior (or senior) votes, or by having the junior and senior votes, together. Listed are all the possible voting combinations: {;0} {So; 5} {Jr; 3} {Sr; 3} {So, Jr; 8} {So, Sr; 8} {Jr, Sr; 6} {So, Jr, Sr; 11} Each of these collections is known as a coalition. Those that are successful are known as winning coalitions.

Coalitions A coalition is any group of voters and a winning coalition is any group of voters that has enough votes to pass an issue. Of the winning coalitions, {So, Jr, Sr; 11} is different in one very important way: If any one of the members decides to vote differently, the coalition sill still win. None of the members is essential to the coalition.

Minimal Winning Coalitions When all of the members are essential to a winning coalition, it is called a minimal winning coalition. The minimal winning coalitions in this example are: {So, Jr; 8} {So, Sr; 8} {Jr, Sr; 6} A winning coalition where, it will become a losing coalition if any of the members are removed is called a minimal winning coalition.

Interesting Results Notice that the sophomore representative is essential to two of the winning coalitions. This is also true of the Senior and Junior representative. In other words, in about the same number of times, each of the representatives can expect to cast a key vote in passing an issue.

A Paradox Although the votes have been distributed to give greater power to the sophomores, the actual outcome is that all the members have the same amount of power!

Distribution of Power Since distributing the number of votes in this way population does not reflect the fair distribution of power, mathematical procedures can be used to find a way to measure actual power when weighted voting is used.

Power Index A measure of the power of a member of a voting body is called a power index. The power index is the number of winning coalitions to which each member of that body is essential. In our example, each member is essential to 2 winning coalitions and thereby has a power index of 2.

Algorithms An algorithm is a procedure for solving a problem. They are usually presented in numbered steps to make them easy to apply. Here is an example of a power index algorithm:

Power Index Algorithm List all coalitions of voters that are winning coalitions. Select any voter and record a 0 for that voters power index. From the list in Step 1 select any coalition of which the voter is a member. Subtract from the coalition's vote total the number of votes that this voter has. If the result is less than the number of votes necessary to pass an issue, add 1 to the voter's power index.

Power Index Algorithm(cont'd) Repeat step until you have checked all the coalitions for which the voter is a member. Repeat Steps 2 through 4 until you have checked all the voters.

Consider this! We have a group of three members in which A has seven 7 votes, B has 3 and C has 3. List all the coalitions and then divide out the winning coalitions:

Winning Coalitions All coalitions: { ; 0} {A; 7} {B; 3} {C; 3} {A, B; 10} {A, C; 10} {B, C; 6} {A, B, C; 13} Winning coalitions: {A; 7} {A, B; 10} {A, C; 10} {A, B, C; 13}

Power Holder In this situation, A is the only one with any power. All four of the winning coalitions will become losing coalitions if A is removed. B and C have no power because every winning coalition will remain winning is removed.

Power Holder (cont’d) If one member has over half of the votes, that member alone is essential to the winning coalitions and so is known as a dictator. When a member is essential to no winning coalitions, that member is known as a dummy. In the last example, A is the dictator and B and C are dummies.

Practice Problems Consider a situation in which A, B and C have 3, 2 and 1 votes, respectively in which 4 votes are needed to pass an issue. List all possible coalitions, all winning coalitions and all minimal winning coalitions. Determine the power index for each voter. Suppose that the number of votes needed to pass an issue is increased from 4 to 5. Determine the power index of each.

More Practice In the student council example in this section, can the votes be distributed so that the members’ power indices will follow the ratio of the class sizes? In the student council example, suppose that the representatives of the junior and senior classes always differ on issues and never vote alike. Does this make any practical difference in the power of the three representatives?

More Practice 4. One way to determine all winning coalitions and all minimal winning coalitions in a weighted voting situation is to work from a list of all possible coalitions. Use A, B, C and D to represent all possible coalitions.

More Practice Consider a situation in which A has 4 votes, B has 5, C has 7 and D has 9. If 13 votes are needed to pass an issue, determine: All possible coalitions, all winning coalitions and all minimal winning coalitions. Determine the power index of each voter Suppose the number of votes need to pass an issue increased from 12 to 15. How would this affect the power index of each voter?