Examples Calculate Voting Methods Outcomes In Liberal Arts Math Course

Calculate and compare election results using different voting methods for your liberal arts math course. Explore plurality, Borda count, instant-runoff, and more with this interactive tool.

Comprehensive Guide to Calculating Voting Methods Outcomes in Liberal Arts Math

Understanding different voting methods and their outcomes is a fundamental concept in liberal arts mathematics, particularly in courses that explore social choice theory, game theory, and political science applications. This guide provides a detailed examination of various voting systems, their mathematical properties, and practical examples to help students analyze election results critically.

Why Study Voting Methods in Mathematics?

The study of voting methods intersects mathematics, political science, and philosophy. Mathematical analysis of voting systems reveals:

• Fairness criteria: How different systems satisfy (or fail to satisfy) properties like the Condorcet criterion, independence of irrelevant alternatives, and monotonicity
• Strategic considerations: How voters might manipulate outcomes based on the voting method
• Paradoxes: Situations like the Condorcet paradox where collective preferences become cyclic
• Real-world applications: How different democracies implement various voting systems

Key Insight: Arrow’s Impossibility Theorem (1950) proves that no voting system can simultaneously satisfy all of these desirable properties: unanimity, non-dictatorship, independence of irrelevant alternatives, and universal domain.

Major Voting Methods and Their Calculation

1. Plurality Voting

The simplest voting method where each voter selects one candidate, and the candidate with the most votes wins. Despite its simplicity, plurality voting often fails to represent the will of the majority and is susceptible to the “spoiler effect.”

Mathematical Representation:

For n candidates and m voters, let v_i represent votes for candidate i. The winner is:

winner = argmax_i(v_i) for i = 1, 2, …, n

Example Calculation:

Candidate	Votes Received	Percentage
Alice	420	42%
Bob	380	38%
Charlie	200	20%
Total	1000	100%

Despite 60% of voters preferring Bob or Charlie over Alice, Alice wins with only 42% of the vote under plurality rules.

2. Borda Count

Named after Jean-Charles de Borda, this method has voters rank all candidates. Each rank position is assigned points (e.g., 1st place = n points, 2nd place = n-1 points, etc.), and the candidate with the highest total score wins.

Mathematical Representation:

For n candidates and m voters, let r_ij be the rank position (1 = highest) of candidate i by voter j. The Borda score for candidate i is:

BordaScore_i = Σ (n – r_ij) for j = 1 to m

Example Calculation:

Voter Group	Size	1st Choice (3 pts)	2nd Choice (2 pts)	3rd Choice (1 pt)
A	40%	Alice	Bob	Charlie
B	35%	Bob	Charlie	Alice
C	25%	Charlie	Alice	Bob

Candidate	Borda Score Calculation	Total Score
Alice	(40×3) + (35×1) + (25×2) = 120 + 35 + 50	205
Bob	(40×2) + (35×3) + (25×1) = 80 + 105 + 25	210
Charlie	(40×1) + (35×2) + (25×3) = 40 + 70 + 75	185

Bob wins with the highest Borda score of 210, demonstrating how Borda count can produce different results than plurality voting.

3. Instant-Runoff Voting (IRV)

Also known as ranked-choice voting, IRV has voters rank candidates in order of preference. Candidates are eliminated in rounds, with votes redistributed until one candidate achieves a majority.

Mathematical Process:

1. Count first-choice votes
2. If no majority, eliminate last-place candidate
3. Redistribute votes from eliminated candidate based on next preferences
4. Repeat until one candidate has >50% of active votes

Example Calculation:

Round	Alice	Bob	Charlie	Active Votes	Action
1	420 (42%)	380 (38%)	200 (20%)	1000	Charlie eliminated (lowest)
2	420 (44.2%)	380 + 120 = 500 (52.6%)	–	920	Bob achieves majority

Bob wins in the second round with 52.6% of the vote after Charlie’s elimination and vote redistribution.

4. Approval Voting

Voters can approve of any number of candidates, and the candidate with the most approvals wins. This method is simple yet avoids some pitfalls of plurality voting.

Mathematical Representation:

For n candidates and m voters, let a_ij = 1 if voter j approves candidate i, else 0. The approval score for candidate i is:

ApprovalScore_i = Σ a_ij for j = 1 to m

5. Condorcet Methods

Condorcet methods elect the candidate who would win a two-candidate election against each of the other candidates. This candidate is known as the Condorcet winner.

Pairwise Comparison Matrix:

	Alice	Bob	Charlie
Alice	–	420 vs 580	650 vs 350
Bob	580 vs 420	–	700 vs 300
Charlie	350 vs 650	300 vs 700	–

Bob is the Condorcet winner, defeating both Alice (580-420) and Charlie (700-300) in head-to-head comparisons.

Comparative Analysis of Voting Methods

The choice of voting method significantly impacts election outcomes. The following table compares key properties of the major voting systems:

Property	Plurality	Borda Count	IRV	Approval	Condorcet
Majority Criterion	❌	❌	✅	❌	✅
Condorcet Criterion	❌	❌	❌	❌	✅
Independence of Irrelevant Alternatives	✅	❌	❌	✅	✅
Monotonicity	✅	✅	✅	✅	✅
Resistance to Strategic Voting	❌	❌	⚠️	✅	⚠️
Complexity for Voters	Low	Medium	High	Low	High

Real-World Applications and Case Studies

Different voting methods are employed around the world with varying consequences:

• United States: Primarily uses plurality voting for most elections, though some states (Maine, Alaska) have adopted IRV for certain races. The 2000 presidential election demonstrated plurality voting’s limitations when George W. Bush won despite receiving fewer total votes than Al Gore.
• Australia: Uses IRV (called “preferential voting”) for its House of Representatives elections since 1918. This has generally led to more consensus-oriented candidates winning office.
• France: Employs a two-round system similar to IRV for presidential elections. In 2017, this system prevented Marine Le Pen from winning by allowing voters to coalesce around Emmanuel Macron in the second round.
• Mathematics Organizations: The Mathematical Association of America uses approval voting for some of its elections, recognizing its advantages in multi-candidate races.

Mathematical Properties and Theorems

Arrow’s Impossibility Theorem

Kenneth Arrow’s 1950 theorem demonstrates that no voting system can simultaneously satisfy these four fairness criteria:

1. Unanimity: If every voter prefers A over B, then the group should prefer A over B
2. Non-dictatorship: No single voter should determine the group’s preference
3. Independence of Irrelevant Alternatives: The group’s preference between A and B should depend only on individual preferences between A and B
4. Universal Domain: The system should work for any set of individual preferences

Gibbard-Satterthwaite Theorem

This theorem proves that any voting system with three or more candidates is susceptible to strategic voting (where voters don’t vote sincerely to achieve a better outcome) unless it’s dictatorial.

May’s Theorem

For two-candidate elections, Kenneth May proved that majority rule is the only voting system that satisfies anonymity (all voters treated equally), neutrality (all candidates treated equally), and positive responsiveness (if a voter changes their preference in favor of a candidate, that candidate’s chance of winning should not decrease).

Pedagogical Approaches for Teaching Voting Methods

Effective strategies for teaching voting methods in liberal arts math courses include:

• Interactive Simulations: Use tools like the calculator above to let students experiment with different voting methods and see how outcomes change
• Historical Case Studies: Analyze real elections where different voting methods would have produced different winners
• Game Theory Connections: Explore how strategic voting emerges under different systems
• Social Choice Paradoxes: Demonstrate the Condorcet paradox and other counterintuitive results
• Comparative Analysis: Have students evaluate which voting method best aligns with different societal values

Common Misconceptions and Clarifications

Students often hold incorrect beliefs about voting systems that instructors should address:

1. “The candidate with the most votes always wins”: Only true for plurality in single-winner elections. Other methods may select different winners.
2. “Ranked voting is always better”: While ranked methods have advantages, they also have complexities and potential drawbacks like non-monotonicity in some variants.
3. “Approval voting leads to too many compromise candidates”: Empirical evidence suggests approval voting often elects candidates with broad support.
4. “The Condorcet winner always exists”: In cases of cyclic preferences (Condorcet paradox), no Condorcet winner exists.
5. “Voting methods don’t affect representation”: The choice of system significantly impacts which groups gain representation.

Advanced Topics and Research Directions

For students interested in deeper exploration, these advanced topics connect voting theory to current research:

• Computational Complexity: Some voting methods (like Kemeny-Young) are NP-hard to compute for large numbers of candidates
• Voting in Multi-Winner Elections: Systems like Single Transferable Vote (STV) for electing multiple representatives
• Liquid Democracy: Hybrid systems combining direct and representative democracy
• Voting with Incomplete Preferences: Handling cases where voters don’t rank all candidates
• Manipulation Resistance: Designing systems that minimize incentives for strategic voting

Authoritative Resources for Further Study

For additional reliable information on voting methods and their mathematical properties, consult these authoritative sources:

• American Mathematical Society – “The Mathematics of Voting” (PDF) – Comprehensive mathematical treatment of voting systems
• Stanford Encyclopedia of Philosophy – “Voting Methods” – Philosophical and mathematical analysis of voting systems
• RangeVoting.org – Advocacy and analysis site with extensive comparisons of voting methods
• National Institute of Standards and Technology – Voting Systems – Technical standards and research on election systems

Classroom Activities and Assessment Ideas

Engaging activities to reinforce understanding of voting methods:

1. Election Simulation: Have students participate in a mock election using different voting methods and compare results
2. Voting Method Debate: Assign groups to research and defend different voting systems
3. Paradox Discovery: Challenge students to construct preference profiles that create Condorcet cycles
4. System Design: Have students propose a new voting method that addresses specific fairness criteria
5. Real Election Analysis: Analyze a recent election and determine how different voting methods would have changed the outcome

Teaching Tip: Use the calculator at the top of this page as an interactive demonstration tool. Have students input different preference distributions and observe how the same votes can produce different winners under various systems.

Conclusion: The Importance of Voting Theory in Liberal Arts Mathematics

The study of voting methods offers liberal arts mathematics students a unique intersection of pure mathematics, social science, and civic engagement. By understanding the mathematical properties of different voting systems, students develop:

• Critical thinking skills to evaluate election systems
• Quantitative reasoning to analyze complex social choice problems
• Appreciation for mathematical modeling of real-world systems
• Informed citizenship to participate knowledgeably in democratic processes

As societies continue to debate electoral reform, the mathematical analysis of voting systems remains an essential tool for designing fairer, more representative democratic institutions. The concepts explored in this guide provide foundational knowledge for students to engage with these important societal questions from a mathematically informed perspective.