Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

The Method of Pairwise Comparisons: A Voting System, Study notes of Discrete Mathematics

The Method of Pairwise Comparisons, a voting system proposed by Marie Jean Antoine Nicolas de Caritat, marquis de Condorcet. The system involves comparing each pair of candidates and awarding points based on the winner of each comparison. The candidate with the most points wins the election. The document also discusses the advantages and disadvantages of this system, including its satisfaction of the Majority, Condorcet, Public-Enemy, and Monotonicity criteria.

Typology: Study notes

2021/2022

Uploaded on 09/27/2022

myboy
myboy 🇺🇸

4.4

(72)

260 documents

1 / 30

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
The Method of Pairwise Comparisons
Suggestion from a Math 105 student (8/31/11): Hold a
knockout tournament between candidates.
IThis satisfies the Condorcet Criterion! A Condorcet
candidate will win all his/her matches, and therefore win
the tournament. (Better yet, seeding doesn’t matter!)
IBut, if there is no Condorcet candidate, then it’s not
clear what will happen.
IUsing preference ballots, we can actually hold a
round-robin tournament instead of a knockout.
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e

Partial preview of the text

Download The Method of Pairwise Comparisons: A Voting System and more Study notes Discrete Mathematics in PDF only on Docsity!

The Method of Pairwise Comparisons

Suggestion from a Math 105 student (8/31/11): Hold a knockout tournament between candidates.

I (^) This satisfies the Condorcet Criterion! A Condorcet candidate will win all his/her matches, and therefore win the tournament. (Better yet, seeding doesn’t matter!)

I (^) But, if there is no Condorcet candidate, then it’s not clear what will happen.

I (^) Using preference ballots, we can actually hold a round-robin tournament instead of a knockout.

The Method of Pairwise Comparisons (§1.5)

The Method of Pairwise Comparisons

Proposed by Marie Jean Antoine Nicolas de Caritat, marquis de Condorcet (1743–1794)

I (^) Compare each two candidates head-to-head. I (^) Award each candidate one point for each head-to-head victory. I (^) The candidate with the most points wins.

The Method of Pairwise Comparisons

Number of Voters 14 10 8 4 1 1st choice A C D B C 2nd choice B B C D D 3rd choice C D B C B 4th choice D A A A A

Compare A to B. I (^) 14 voters prefer A. I (^) 10+8+4+1 = 23 voters prefer B. I (^) B wins the pairwise comparison and gets 1 point.

The Method of Pairwise Comparisons

Number of Voters 14 10 8 4 1 1st choice A C D B C 2nd choice B B C D D 3rd choice C D B C B 4th choice D A A A A

Compare C to D: I (^) 14+10+1 = 25 voters prefer C. I (^) 8+4 = 12 voters prefer D. I (^) C wins the pairwise comparison and gets 1 point.

The Method of Pairwise Comparisons

Number of Voters 14 10 8 4 1 1st choice A C D B C 2nd choice B B C D D 3rd choice C D B C B 4th choice D A A A A

A B C D Wins Losses Points A B C D

The Method of Pairwise Comparisons

Number of Voters 14 10 8 4 1 1st choice A C D B C 2nd choice B B C D D 3rd choice C D B C B 4th choice D A A A A

A B C D Wins Losses Points A 14 B 23 C D

The Method of Pairwise Comparisons

Number of Voters 14 10 8 4 1 1st choice A C D B C 2nd choice B B C D D 3rd choice C D B C B 4th choice D A A A A

A B C D Wins Losses Points A 14 14 14 B 23 18 C 23 19 D 23

The Method of Pairwise Comparisons

Number of Voters 14 10 8 4 1 1st choice A C D B C 2nd choice B B C D D 3rd choice C D B C B 4th choice D A A A A

A B C D Wins Losses Points A 14 14 14 B 23 18 28 C 23 19 25 D 23 9 12

The Method of Pairwise Comparisons

Number of Voters 14 10 8 4 1 1st choice A C D B C 2nd choice B B C D D 3rd choice C D B C B 4th choice D A A A A

A B C D Wins Losses Points A 14 14 14 — B,C,D 0 B 23 18 28 A,C D 2 C 23 19 25 A,B,D — 3 Winner! D 23 9 12 A B,C 1

Evaluating the Method of Pairwise Comparisons

I (^) The Method of Pairwise Comparisons satisfies the Majority Criterion. (A majority candidate will win every pairwise comparison.)

Evaluating the Method of Pairwise Comparisons

I (^) The Method of Pairwise Comparisons satisfies the Public-Enemy Criterion. (If there is a public enemy, s/he will lose every pairwise comparison.)

Evaluating the Method of Pairwise Comparisons

I (^) The Method of Pairwise Comparisons satisfies the Public-Enemy Criterion. (If there is a public enemy, s/he will lose every pairwise comparison.)

I (^) The Method of Pairwise Comparisons satisfies the Monotonicity Criterion. (Ranking Candidate X higher can only help X in pairwise comparisons.)

How Many Pairwise Comparisons?

Problem #1: It’s somewhat inefficient. How many pairwise comparisons are necessary if there are N candidates? How many spaces are there in the crosstable?

A B C D E

A

B

C

D

E

How Many Pairwise Comparisons?

I (^) N^2 squares in crosstable I (^) N squares on the main diagonal don’t count I (^) Other squares all come in pairs

Number of comparisons =

N^2 − N

N(N − 1)