Chapter 3 Section 1 MA1020 Quantitative Literacy Sidney Butler - PowerPoint PPT Presentation

Dec 11, 2023 •33 likes •133 views

Chapter 3 Section 1 MA1020 Quantitative Literacy Sidney Butler Michigan Technological University September 18, 2006 S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 1 / 10 Voting Systems Plurality method Borda count method

Chapter 3 Section 1 MA1020 Quantitative Literacy Sidney Butler Michigan Technological University September 18, 2006 S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 1 / 10
Voting Systems Plurality method Borda count method Plurality with elimination method Pairwise comparison method S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 2 / 10
Plurality Definition Voters vote for one candidate. The candidate receiving the most votes is selected. US to elect senators, representatives, governors, judges and mayors. UK and Canada to elect member of parliament. S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 3 / 10
Borda Count Definition Voters rank the m candidates. A voter’s last choice gets one point, next-to-last choice gets two points, and so on, until the voter’s first choice gets m points. The candidate receiving the most points is selected. Heisman trophy S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 4 / 10
Borda Count S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 5 / 10
Plurality with Elimination Definition Voters vote for one candidate. if a candidate receives a majority of votes that candidate is selected. If no candidate receives a majority, eliminate the candidate(s) receiving the fewest votes, and do another round of voting. Olympic games location President of France S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 6 / 10
Plurality with Elimination S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 7 / 10
Pairwise Comparison Definition Voters rank all the candidates. For each pair of candidates, X and Y , determine how many voters prefer X to Y and vice versa. If X is preferred to Y by more voters, then X receives 1 point. If Y is preferred to X by more voters, then Y receives 1 point. If the candidates tie, then each receives 1 2 point. The candidate who receives the most points is selected. S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 8 / 10
Pairwise Comparison S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 9 / 10
Tie Breaking Method should be chosen before the election. Arbitrary Choice Another Voter S Butler (Michigan Tech) Chapter 3 Section 1 September 18, 2006 10 / 10

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

SECTION 1 What Is Supply? SECTION 2 The Theory of Production SECTION 3 Cost, Revenue, and

CHAPTER INTRODUCTION SECTION 1 What Is Supply? SECTION 2 The Theory of Production SECTION 3 Cost, Revenue, and Profit Maximization CHAPTER SUMMARY CHAPTER ASSESSMENT Click a hyperlink to go to the corresponding section. Press the ESC key

824 views • 65 slides

Chapter 5 Local Area Networks Computer Concepts 2013 5 Chapter Contents Section A: Network

13-10-11 Chapter 5 Local Area Networks Computer Concepts 2013 5 Chapter Contents Section A: Network Building Blocks Section B: Wired and Wireless Technologies Section C: Network Setup Section D: Sharing Files Section

357 views • 16 slides

Chapter 2 Economic Systems and Decision Making CHAPTER INTRODUCTION SECTION 1 Economic Systems

Chapter 2 Economic Systems and Decision Making CHAPTER INTRODUCTION SECTION 1 Economic Systems SECTION 2 Evaluating Economic Performance SECTION 3 Capitalism and Economic Freedom CHAPTER SUMMARY CHAPTER ASSESSMENT Click a hyperlink to

529 views • 30 slides

Speech recognition (briefly) Chapter 15, Section 6 Chapter 15, Section 6 1 Outline Speech

Speech recognition (briefly) Chapter 15, Section 6 Chapter 15, Section 6 1 Outline Speech as probabilistic inference Speech sounds Word pronunciation Word sequences Chapter 15, Section 6 2 Speech as probabilistic inference

381 views • 15 slides

Speech recognition (briefly) Chapter 15, Section 6 Chapter 15, Section 6 1 Outline Speech

401 views • 14 slides

Neural networks Chapter 20, Section 5 Chapter 20, Section 5 1 Outline Brains Neural

Neural networks Chapter 20, Section 5 Chapter 20, Section 5 1 Outline Brains Neural networks Perceptrons Multilayer perceptrons Applications of neural networks Chapter 20, Section 5 2 Brains 10 11 neurons of > 20 types,

443 views • 21 slides

Chapter 20 Homeowners Insurance, Section I Agenda Homeowners Insurance Basics Analysis

4/14/2015 Chapter 20 Homeowners Insurance, Section I Agenda Homeowners Insurance Basics Analysis of Homeowners 3 Policy Section I Coverages Section I Perils Insured Against Section I Exclusions Section I Conditions

533 views • 10 slides

Senate Bill No. 1765 CHAPTER 927 An act to add Chapter 8 (commencing with Section 119400) to Part

Senate Bill No. 1765 CHAPTER 927 An act to add Chapter 8 (commencing with Section 119400) to Part 15 of Division 104 of the Health and Safety Code, relating to pharmaceutical marketing. [Approved by Governor September 29, 2004. Filed with

268 views • 4 slides

For Thursday Read Weiss, chapter 4, section 3 Homework: Weiss, chapter 7, exercise 15

For Thursday Read Weiss, chapter 4, section 3 Homework: Weiss, chapter 7, exercise 15 Quicksort homework from ReggieNet Extra Credit Opportunity 2005 CS alum Brandon Dewitt VP of Engineering at MoneyDesktop Giving a talk

729 views • 17 slides

Planning and Acting Chapter 11, Section 3 of; based on AIMA Slides c Artificial Intelligence,

Planning and Acting Chapter 11, Section 3 of; based on AIMA Slides c Artificial Intelligence, spring 2013, Peter Ljungl Stuart Russel and Peter Norvig, 2004 Chapter 11, Section 3 1 Outline The real world Sensorless/contingent

465 views • 20 slides

Disenfranchising Creditors in Chapter 11: In Search of the Meaning of Bad Faith under Section

Disenfranchising Creditors in Chapter 11: In Search of the Meaning of Bad Faith under Section 1126(e) March/April 2007 Mark G. Douglas The ability of a creditor whose claim is impaired to vote on a chapter 11 plan is one of the most

552 views • 11 slides

Section 42A Coastal issues overview: CHAPTER 9 Hazards 1.0 Introduction 1.1 This report

Section 42A Coastal issues overview: CHAPTER 9 Hazards 1.0 Introduction 1.1 This report considers the coastal issues related to the provisions of Chapter 9 Hazards. The section 42A report for Chapter 9 relates to submissions received on

311 views • 7 slides

Math 267, Section E2, 2009f Hailiang Liu December 4, 2009 Chapter 1: First Order Equations

Math 267, Section E2, 2009f Hailiang Liu December 4, 2009 Chapter 1: First Order Equations pp1-99 Chapter 2: Linear equations of higher order, pp100-193 Chapter 3: Power Series Methods pp194- Chapter 4: Laplace Transform methods pp266 325

547 views • 35 slides

Uninformed search algorithms Chapter 3, Section 4 of; based on AIMA Slides c Artificial

Uninformed search algorithms Chapter 3, Section 4 of; based on AIMA Slides c Artificial Intelligence, spring 2013, Peter Ljungl Stuart Russel and Peter Norvig, 2004 Chapter 3, Section 4 1 Tree search algorithms Basic idea: offline,

454 views • 33 slides

For Tuesday Read Russell and Norvig, chapter 4, section 1 Read Russell and Norvig, chapter

For Tuesday Read Russell and Norvig, chapter 4, section 1 Read Russell and Norvig, chapter 5 Do chapter 3, ex 6 (a, b, and d). Program 1 Late Passes You have 2 for the semester. Only good for programs. Allow you to hand in

235 views • 21 slides

For Friday Read Weiss, chapter 6, section 4 Homework: Weiss, chapter 4, exercises 1-2

For Friday Read Weiss, chapter 6, section 4 Homework: Weiss, chapter 4, exercises 1-2 and 8. Make sure you do all of exercise 2 and include parentheses where needed on exercise 8. Programming Assignment 1 Any questions? Binary

406 views • 14 slides

Voting Rules Well discuss voting rules for selecting a single winner from a finite set of

Voting Theory COMSOC 2007 Voting Theory COMSOC 2007 Voting Rules Well discuss voting rules for selecting a single winner from a finite set of candidates . (The number of candidates is m .) A voter votes by submitting a ballot . This

117 views • 7 slides

The Mathematics of Elections Kim Klinger-Logan St. Olaf College February 2019 Its not the

The Mathematics of Elections Kim Klinger-Logan St. Olaf College February 2019 Its not the voting thats democracy; its the counting. Tom Stoppard, Jumpers In the news . . . Bangor Daily News Ranked Choice Voting Consider the

981 views • 69 slides

CSC304 Lecture 15 Voting 2: Gibbard-Satterthwaite Theorem CSC304 - Nisarg Shah 1 Recap We

CSC304 Lecture 15 Voting 2: Gibbard-Satterthwaite Theorem CSC304 - Nisarg Shah 1 Recap We introduced a plethora of voting rules Plurality Plurality with runoff Borda Kemeny Veto Copeland -Approval

577 views • 21 slides

For Friday Read Becker, chapter 9, sections 4, 9-10 Recommended Practice Problems:

For Friday Read Becker, chapter 9, sections 4, 9-10 Recommended Practice Problems: Chapter 9, exercises 3-5 Program 6 Any questions? Questions before the quiz? Quiz File Practice Write code to read a file of integers and

243 views • 13 slides

The Paradox of Grading Systems Steven J. Brams Department of Politics New York University New

The Paradox of Grading Systems Steven J. Brams Department of Politics New York University New York, NY 10012 steven.brams@nyu.edu Richard F. Potthoff Department of Political Science and Social Science Research Institute Duke University

357 views • 20 slides

Math for Liberal Arts MAT 110: Chapter 12 Notes Voting: Does the Majority Always Rule? Voting

11/26/2012 Math for Liberal Arts MAT 110: Chapter 12 Notes Voting: Does the Majority Always Rule? Voting Methods David J. Gisch Choosing a Winner Maj ority Rule In elections with more then 2 candidates, there are The simplest type of

374 views • 6 slides

On Top-k Selection from m-wise Partial Rankings via Borda Counting Wenjing Chen 1 Ruida Zhou 1 Chao

On Top-k Selection from m-wise Partial Rankings via Borda Counting Wenjing Chen 1 Ruida Zhou 1 Chao Tian 1 Cong Shen 2 1 Department of Electrical and Computer Engineering Texas A&M University 2 Electrical and Computer Engineering Department

515 views • 24 slides

Classifier Combination Kuncheva Ch. 3 Motivation Classifiers Are functions that map feature

Classifier Combination Kuncheva Ch. 3 Motivation Classifiers Are functions that map feature vectors to classes. Any single classifier selected will define this function subject to certain biases due to the space of models defined, the

137 views • 12 slides