📚 Electoral Systems: A Mathematical Exploration | 选举系统的数学探究
Electoral systems provide a fascinating intersection between politics and mathematics. At A‑Level, particularly within Edexcel’s Decision Mathematics and Statistics, the study of voting methods reveals how algorithms, combinatorics, and probability can shape democratic outcomes. Understanding the mathematical underpinnings of elections not only strengthens analytical skills but also exposes the hidden assumptions behind different voting rules. From majority rule to proportional representation, mathematical models quantify fairness, efficiency, and strategic behaviour, making this topic both rigorous and highly relevant.
选举制度提供了政治与数学之间一个迷人的交汇点。在A‑Level阶段，特别是在Edexcel的决策数学与统计学中，对投票方法的研究揭示了算法、组合数学和概率如何塑造民主结果。理解选举背后的数学原理，不仅能强化分析能力，还能揭示不同投票规则背后隐藏的假设。从多数决到比例代表制，数学模型将公平性、效率和策略行为加以量化，使这一课题既严谨又具有高度的现实意义。
1. Introduction to Electoral Systems and Mathematics | 选举系统与数学导论
An electoral system is a set of rules that translates individual votes into collective decisions, such as the allocation of seats in a parliament. Mathematically, an election can be modelled as a function that maps a set of preference profiles to a social ordering or a list of winners. This function must often satisfy certain axioms, like non‑dictatorship, Pareto efficiency, and independence of irrelevant alternatives. At A‑Level, we explore both deterministic methods – such as simple majority and runoff systems – and algorithmic seat‑allocation procedures, which form the core of Decision Mathematics 1 (D1). These models are underpinned by combinatorics, sorting algorithms, and weighted averages.
选举系统是一套将个人选票转化为集体决策的规则，例如议会席位的分配。从数学上讲，一次选举可以建模为一个函数，将一组偏好档案映射到社会排序或获胜者名单。这个函数通常必须满足某些公理，如非独裁性、帕累托效率和不相关选项的独立性。在A‑Level中，我们既探讨确定性的方法——比如简单多数制和两轮决选制——也探讨算法化的席位分配程序，它们是决策数学D1的核心。这些模型以组合数学、排序算法和加权平均为基础。
2. First‑Past‑The‑Post (FPTP) and Its Paradoxes | 多数制及其悖论
The simplest electoral system is First‑Past‑The‑Post (FPTP), where each voter selects one candidate, and the candidate with the most votes wins, even without an absolute majority. Mathematically, this is equivalent to taking the mode of the vote distribution. However, FPTP can lead to counter‑intuitive results: a candidate disliked by a majority can still win if the opposition vote is split. This is a direct consequence of the ‘spoiler effect’, which can be modelled using probability trees and vote‑share matrices. For A‑Level purposes, analysing FPTP involves constructing preference tables and identifying Condorcet losers who nonetheless win.
最简单的选举制度是多数制（FPTP），每位选民选择一名候选人，得票最多者当选，即便未达绝对多数。从数学上看，这等同于取投票分布的众数。然而，FPTP可能导致违反直觉的结果：一个为大多数选民所不喜的候选人，只要反对票分散，仍能获胜。这是’搅局效应’的直接后果，可以用概率树和得票份额矩阵来建模。就A‑Level而言，分析FPTP需要构建偏好表，并识别出尽管是孔多塞败者却依然获胜的情况。
3. Proportional Representation (PR) and Seat Allocation | 比例代表制与席位分配
Proportional Representation (PR) aims to allocate seats in proportion to votes received. This naturally leads to a mathematical problem: how to convert fractions of votes into whole numbers of seats while minimising distortion. The core challenge is the apportionment paradox, where rounding adjustments can produce unexpected outcomes. In Edexcel Decision Mathematics, seat allocation is treated as an algorithmic fair‑division problem. Key concepts include the quota, or the number of votes needed per seat, and the use of divisor methods to systematically allocate remaining seats. These methods can be compared using measures such as the Gallagher index, which is a least‑squares criterion.
比例代表制（PR）旨在按得票比例分配席位。这自然而然地引出一个数学问题：如何将票数分数转化为整数席位，同时将失真降到最低。核心挑战在于分摊悖论，即取整调整可能产生意料之外的结果。在Edexcel决策数学中，席位分配被看作一个算法化的公平分配问题。关键概念包括配额——即每席位所需票数——以及使用除数法来系统性地分配剩余席位。可以通过加拉格尔指数这样的最小二乘准则来比较这些方法。
4. The D’Hondt Method – A Mathematical Algorithm | 洪德法——一种数学算法
The D’Hondt method is a highest‑averages divisor rule widely used to allocate seats in party‑list PR systems. Mathematically, it works by repeatedly dividing each party’s vote total by successive integers (1, 2, 3, …) and then awarding seats to the largest resulting quotients. This is essentially a quotient‑based sorting algorithm and appears in D1 as an application of list processing and greedy allocation. The formula for the priority value is V ÷ (s + 1), where V is the party’s vote count and s is the number of seats already allocated to that party. A key property is that D’Hondt slightly favours larger parties due to the sequence of divisors.
洪德法是一种最高平均数除数规则，广泛用于政党名单比例代表制的席位分配。数学上，它通过将每个政党的得票数依次除以连续整数（1，2，3……），然后把席位授予那些最大的商数。这本质上是一种基于商的排序算法，并在D1中作为列表处理和贪心分配的应用出现。优先值的计算公式为V ÷ (s + 1)，其中V是政党的得票数，s是该党已分得的席位数。一个关键性质是，由于除数的序列，洪德法略微有利于大党。
5. The Sainte‑Laguë Method – An Alternative Formula | 圣拉格法——另一种公式
The Sainte‑Laguë method (or Webster method) also uses a divisor sequence, but with odd numbers: 1, 3, 5, 7, … The priority value is V ÷ (2s + 1). This design reduces the bias towards larger parties and is considered more neutral. In A‑Level Decision Mathematics, comparing D’Hondt and Sainte‑Laguë illustrates how a small change in the divisor formula can significantly alter seat distributions. Students can model this using spreadsheet simulations and trace tables, calculating quotients step by step and observing the rank‑order of awarded seats. The choice between methods can be framed as an optimisation problem under different fairness constraints.
圣拉格法（或韦伯斯特法）也使用除数序列，但采用奇数：1，3，5，7…… 优先值计算公式为V ÷ (2s + 1)。这种设计减小了对大党的偏袒，被认为更加中立。在A‑Level决策数学中，比较洪德法和圣拉格法可以说明除数公式的微小改变如何显著影响席位分布。学生可以利用电子表格模拟和追踪表进行建模，逐步计算商数，并观察授予席位的排序。方法之间的选择可以被看作不同公平约束下的优化问题。
6. Condorcet Paradox and Cyclic Preferences | 孔多塞悖论与循环偏好
The Condorcet paradox occurs when collective preferences become cyclic, even though every individual voter has transitive (non‑cyclic) preferences. For example, three voters with rankings A>B>C, B>C>A, and C>A>B produce a majority cycle: A beats B, B beats C, but C beats A. This demonstrates that the ‘pairwise majority winner’ may not exist. From a mathematical standpoint, the paradox is a manifestation of non‑transitivity in aggregated orders and can be analysed using directed graphs (digraphs) where vertices represent candidates and arcs indicate pairwise victories. Condorcet methods seek to resolve such cycles, using ideas like the Schulze beatpath algorithm or the ranked‑pairs method, which are studied in Decision Mathematics under tournament sorting.
当集体偏好出现循环，而每个选民个体的偏好却具有传递性（非循环）时，孔多塞悖论便发生了。例如，三位选民的排序分别为A>B>C、B>C>A和C>A>B，会产生多数循环：A击败B，B击败C，但C击败A。这表明’两两对决的多数胜者’可能不存在。从数学角度看，该悖论是聚合序中非传递性的表现，可以用有向图来分析，其中顶点代表候选人，有向边表示两两对决的胜利。孔多塞方法试图通过舒尔茨胜径算法或排序配对法等思路来解决此类循环，这些方法属于决策数学中锦标赛排序的研究范畴。
7. Arrow’s Impossibility Theorem | 阿罗不可能定理
Arrow’s Impossibility Theorem is a landmark result in social choice theory, proving that no rank‑order electoral system can simultaneously satisfy a small set of seemingly reasonable conditions when there are three or more candidates. The conditions are: unrestricted domain, non‑dictatorship, Pareto efficiency, and independence of irrelevant alternatives (IIA). Mathematically, the theorem shows that the set of preference profiles cannot be consistently aggregated without violating at least one axiom. For A‑Level students, understanding the proof involves logical deduction and counterexample construction, reinforcing skills in set theory and propositional logic. This theorem is often explored in extension material for Further Mathematics, linking voting to axiomatic systems.
阿罗不可能定理是社会选择理论中的一个里程碑式结果，它证明：当存在三个或更多候选人时，任何排序选举制度都无法同时满足一小套看似合理的条件。这些条件是：无限制域、非独裁性、帕累托效率和不相关选项独立性（IIA）。从数学上讲，该定理表明，偏好档案集合不可能在不违反至少一条公理的情况下被一致地聚合。对A‑Level学生而言，理解证明涉及逻辑推导和反例构建，从而巩固集合论与命题逻辑的技能。该定理常作为进阶数学的拓展材料，将投票与公理体系联系起来。
8. Borda Count and Weighted Voting | 博尔达计数与加权投票
The Borda count is a positional voting system where voters rank candidates, and each position carries a fixed number of points. For n candidates, the top rank receives n‑1 points, the next n‑2, down to 0 for the last. The winner is the candidate with the highest total score. Mathematically, this is a linear transformation of the preference matrix into a sums vector. Borda count can yield different winners than plurality or Condorcet methods, allowing an analysis of sensitivity to point allocation. In Decision Mathematics, this is akin to a weighted sum algorithm, and variations like the Dowdall system (1, ½, ⅓, …) alter the weighting scheme.
博尔达计数是一种位置投票制，选民对候选人进行排序，每个位置带有固定的分数。对于n名候选人，首位得n‑1分，次位得n‑2分，末位得0分。总得分最高的候选人获胜。从数学上讲，这是将偏好矩阵线性变换为总得分的向量。博尔达计数可能产生与多数决或孔多塞方法不同的胜者，从而能够分析对分值分配的敏感性。在决策数学中，这与加权求和算法类似，而诸如道达尔系统（1, ½, ⅓, ……）这样的变体则改变了加权方案。
9. Strategic Voting and Game Theory | 策略投票与博弈论
Voters may not always vote sincerely; they might engage in strategic voting to prevent an undesirable outcome. This turns an election into a game where each voter’s payoff depends on others’ choices. Game theory, a topic in Edexcel’s Decision Mathematics 2, provides tools to model such behaviour using payoff matrices and Nash equilibrium. For instance, in a FPTP system, supporters of a minor candidate may vote tactically for a major candidate to block a disliked opponent. Mixed‑strategy equilibria can be identified, showing that rational behaviour often leads to outcomes that diverge from the sincere majority will.
选民并非总凭本心投票；他们可能进行策略投票，以防止不希望的结果出现。这就将选举转化成了一个博弈，每个选民的收益取决于他人的选择。博弈论是Edexcel决策数学2中的一个主题，它提供了使用收益矩阵和纳什均衡来建模此类行为的工具。例如，在多数制下，小候选人的支持者可能会策略性地投给大候选人，以阻挡不喜欢的对手。可以识别出混合策略均衡，表明理性行为常常导致偏离真诚多数意愿的结果。
10. Gerrymandering – Geometry and Statistics | 杰利蝾螈——几何与统计
Gerrymandering is the manipulation of electoral district boundaries to favour a particular party. Mathematically, this is a geometric partitioning problem: given a distribution of voters, how can one draw district lines to maximise or minimise seat share? Metrics such as the efficiency gap – the difference between wasted votes for the two parties divided by total votes – provide a statistical measure of bias. In A‑Level Statistics, one can use the binomial and normal distributions to test whether a given district plan produces significantly skewed outcomes. Compactness measures, like the Polsby‑Popper ratio (4π × area / perimeter²), link geometry to fairness.
杰利蝾螈是指为偏袒某一政党而操纵选区边界。从数学上讲，这是一个几何划分问题：给定选民分布，如何划分选区界线以最大化或最小化席位份额？诸如效率差距（两党浪费票数之差除以总票数）等指标提供了偏见的统计量度。在A‑Level统计学中，可以使用二项分布和正态分布来检验某个选区方案是否产生显著偏斜的结果。紧凑性度量，例如波斯比‑波普比率（4π × 面积 / 周长²），将几何与公平性联系起来。
11. Real‑World Examples and Mathematical Analysis | 实例与数学分析
To solidify these concepts, consider the 2024 UK General Election under FPTP, simulated with the D’Hondt method for proportional comparison. Using actual vote percentages, students can calculate hypothetical seat allocations and observe the disproportionality. Another example is the US Electoral College, which can be modelled as weighted voting where each state’s weight is its electoral vote count. The power index, such as the Banzhaf index, measures the probability that a single vote can change the outcome. These examples require constructing tables and performing iterative calculations, directly applicable to A‑Level problem‑solving exercises.
为巩固这些概念，可考虑2024年英国大选在多数制下的情况，并用洪德法模拟比例代表制以进行比较。利用实际得票百分比，学生可以计算假设的席位分配，并观察到不成比例的现象。另一个例子是美国选举人团，可将其建模为加权投票，其中每个州的权重为其选举人票数。权力指数，如班扎夫指数，衡量单张选票能改变结果的概率。这些例子需要构建表格并进行迭代计算，可直接应用于A‑Level的问题解决练习。
12. Conclusion – The Mathematics of Fair Elections | 结语 – 公平选举的数学
The mathematical study of electoral systems reveals that no single method is perfectly fair in all aspects. Each system implements a different trade‑off between proportionality, simplicity, and resistance to tactical manipulation. By applying Decision Mathematics algorithms and statistical analysis, A‑Level students can critically evaluate the rules that govern democratic processes. This topic bridges abstract theory and real civic life, demonstrating that mathematics is an indispensable tool for designing and scrutinising the machinery of democracy.
对选举制度的数学研究表明，没有哪一种方法在所有方面都完全公平。每种制度都在比例性、简洁性和抵御策略操纵之间实施了不同的权衡。通过应用决策数学算法和统计分析，A‑Level学生能够批判性地审视那些支配民主程序的规则。这一课题连接了抽象理论与现实公民生活，表明数学是设计和审查民主机制不可或缺的工具。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply