📚 Current Systems of Representative and Direct Democracy | 代议制与直接民主的现行制度
Democracy is not only a political concept but also a fascinating subject for mathematical modelling. From simple majority votes in a town hall meeting to complex algorithms allocating parliamentary seats, mathematics provides the tools to understand, compare and evaluate the fairness of different democratic systems. This article explores the current systems of representative and direct democracy through a mathematical lens, focusing on voting methods, apportionment, fairness criteria and the paradoxes that reveal the limitations of collective decision‑making. Whether you are studying A‑Level Decision Mathematics or simply curious about how numbers shape our governments, the ideas presented here will deepen your insight into the machinery of modern governance.
民主不仅是一个政治概念，也是数学建模中引人入胜的课题。从市政厅会议中的简单多数票决，到分配议会席位的复杂算法，数学为理解、比较和评价不同民主制度的公平性提供了工具。本文以数学视角审视当代代议制民主与直接民主制度，重点探讨投票方法、席位分配、公平标准以及揭示集体决策局限性的种种悖论。不论你是在学习A Level决策数学，还是单纯好奇数字如何塑造政府，这里所呈现的思想都能加深你对现代治理机制的理解。
1. Democracy as a Decision‑Making Model | 民主作为一种决策模型
where P is the set of preference orders and A is the set of possible outcomes. This abstraction allows us to study properties such as anonymity, neutrality and monotonicity, which are essential for any fair voting procedure. Real‑ cal districts, party lists and constitutional checks, making the mapping far more complex.
一个民主制度可以被看作是将一组个人偏好转化为集体决策的函数。用数学语言表达，如果有 n 个投票者，每个人对候选项有一个偏好排序，那么投票规则就是一个函数 F : Pⁿ → A，其中 P 是偏好序列的集合，A 是可能结果的集合。这种抽象思维使我们能够研究匿名性、中立性和单调性等对任何公平投票程序都至关重要的性质。然而，现实世界的民主国家还必须处理地理选区、政党名单和宪法制衡等实际约束，使得这种映射变得复杂得多。
2. Direct Democracy: Simple Majority and Weighted Voting | 直接民主：简单多数与加权投票
Direct democracy, as practised in referendums and town meetings, typically uses simple majority rule. For two options, the winner is the one receiving more than half of the votes. If we let total votes be V and votes for option A be a, then A wins if a > V/2. This rule is transparent but can lead to the problem of the ‘tyranny of the majority’ when minority interests are continuously overridden. In some direct‑democratic systems, weighted voting is employed, where each voter i has a weight wᵢ, and the outcome is determined by the sum of weights. Weighted voting is common in shareholder meetings and in the EU Council of Ministers, where different member states have different voting powers. Mathematical analysis of such systems involves computing power indices, such as the Banzhaf index and the Shapley‑Shubik index, to measure the actual influence of a voter rather than their nominal weight.
在公投和市民大会中实行的直接民主通常采用简单多数规则。对于两个选项，获胜者是得票超过半数的选项。若设总投票数为 V，选项 A 得票为 a，则当 a > V/2 时 A 获胜。这条规则简明易懂，但当少数群体的利益持续被否决时，可能导致“多数暴政”的问题。在某些直接民主制度中会使用加权投票，即每个投票者 i 拥有一个权重 wᵢ，结果由权重总和决定。加权投票常见于股东大会和欧盟部长理事会，不同成员国拥有不同的投票权。对这类系统的数学分析涉及计算权力指数，例如班扎夫指数和夏普利‑舒比克指数，以衡量一个投票者真实的决策影响力而非其名义权重。
3. Representative Democracy: The Structure of Elections | 代议制民主：选举的底层架构
Representative democracy relies on elections to select individuals who will make decisions on behalf of the electorate. The voting system used to translate citizen preferences into a set of representatives can be classified into two main families: majoritarian systems, such as First‑Past‑The‑Post (FPTP), and proportional representation (PR) systems. Mathematically, we are interested in the choice function and the social welfare function that each method represents. For example, FPTP can be modelled as a plurality function where the candidate with the highest number of votes wins in each constituency, regardless of whether that number exceeds 50% of the total. In a proportional representation system using party lists and a d’Hondt divisor, seats are allocated sequentially by dividing each party’s vote total by increasing divisors to reward larger parties, albeit in a predictable mathematical fashion.
代议制民主依靠选举挑选代表，由这些人代表选民做出决策。将公民偏好转化为一组代表的投票制度可分为两大族类：多数制（如简单多数制 FPTP）和比例代表制（PR）。从数学的角度看，我们关注的是每种方法所代表的选择函数和社会福利函数。例如，FPTP 可以建模为一种多数票函数：在每个选区中得票最多的候选人获胜，不论其得票是否超过总数的 50%。而在采用政党名单和洪德分配法的比例代表制中，席位分配是通过将每个政党的票数除以逐个增大的除数来依次分配，这种方法以可预测的数学方式偏向大党。
4. Apportionment: The Hamilton Method and Its Paradoxes | 席位分配：哈密尔顿法及其悖论
Once the overall share of seats for each party is determined, representative bodies still need to assign a specific number of seats to each region or group. This is the apportionment problem, famously studied in the context of the US House of Representatives. The Hamilton method, also known as the method of largest remainders, first gives each state its lower quota ― the integer part of its exact proportional share ― and then distributes surplus seats one by one according to the largest fractional remainders. While intuitive, this method can produce the Alabama Paradox: an increase in the total number of seats can cause a state to lose a seat. The population paradox and the new states paradox further reveal the inconsistencies that can arise when mathematical rounding is applied to political allocations.
一旦确定了每个政党的总体席位比例，代议机构仍需将具体席位数目分配给各个地区或团体。这就是著名的席位分配问题，其经典案例是美国众议院。哈密尔顿法，又称最大余数法，首先给予各州其比例份额的整数部分（下限配额），然后根据分数余数的大小逐一分配剩余席位。尽管很直观，但这种方法会产生阿拉巴马悖论：总席位增加后，某个州反而可能失去一个席位。人口悖论和新州悖论进一步揭示了将数学取整用于政治分配时可能产生的不一致性。
5. Divisor Methods: Jefferson, Webster and Hill‑Huntington | 除数法：杰斐逊、韦伯斯特与希尔‑亨廷顿法
To avoid the paradoxes of the Hamilton method, divisor methods were developed. All divisor methods work by finding a divisor d such that when each party’s vote or population is divided by d and rounded (or truncated) according to a specific rule, the sum of the resulting seats equals the total number available. The Jefferson method (or d’Hondt) always rounds down, tending to favour larger parties. The Webster method (Sainte‑Laguë) rounds to the nearest integer at the halfway point, offering a more balanced allocation. The Hill‑Huntington method uses the geometric mean of successive integers as the rounding threshold, ensuring that each seat transfer occurs with minimal relative difference in representation. Each of these methods can be analysed with its bias and its compliance with fairness criteria such as quota, population monotonicity and house monotonicity.
为了避免哈密尔顿法的悖论，除数法应运而生。所有除数法的原理都是找一个除数 d，使得各政党票数或各州人口除以 d 后，按特定规则取整（或截断），得到的席位总数恰好等于待分配总席位数。杰斐逊法（即洪德法）总是向下取整，偏向大党。韦伯斯特法（圣拉格法）在 0.5 处四舍五入，分配更为均衡。希尔‑亨廷顿法则使用相邻整数的几何平均数作为取整阈值，确保每次席位转移时相对代表差异最小。每种方法都可以通过其偏倚程度以及在配额、人口单调性和议院单调性等公平准则上的表现来加以分析。
6. Arrow’s Impossibility Theorem and Social Choice | 阿罗不可能定理与社会选择
Arrow’s Impossibility Theorem, a central result in social choice theory, states that when there are at least three alternatives, no voting system can simultaneously satisfy four seemingly reasonable conditions: unrestricted domain, Pareto efficiency, independence of irrelevant alternatives and non‑dictatorship. In mathematical terms, if a social welfare function attempts to aggregate individual ordinal preferences into a collective ranking, at least one of these conditions must be violated. This theorem forces us to accept that every democratic method has inherent flaws. Understanding Arrow’s theorem is crucial for evaluating the mathematical limits of both direct and representative democracy, and it explains why different countries continue to debate the ‘best’ electoral system.
阿罗不可能定理是社会选择理论的核心结论。它指出，当存在至少三个选项时，没有任何投票制度能够同时满足四个看似合理的条件：无限制定义域、帕累托效率、无关选项独立性以及非独裁性。用数学的语言来说，如果一个社会福利函数试图将个体的序数偏好聚合成一个集体排序，则至少有一个条件必然被违反。这一定理迫使我们承认，每一种民主方法都有其内在缺陷。理解阿罗定理对于评估直接民主与代议制民主的数学极限至关重要，也解释了为什么各国至今仍在争论何为“最佳”选举制度。
7. Condorcet Methods and the Paradox of Voting | 孔多塞方法与投票悖论
A Condorcet winner is a candidate who would beat every other candidate in a head‑to‑head contest. Condorcet methods aim to elect such a winner if one exists. However, the Condorcet paradox demonstrates that collective preferences can be cyclic: candidate A beats B, B beats C, yet C beats A, even when every individual voter has transitive preferences. In matrix form, the pairwise comparison matrix can contain cycles, and the Borda count or Copeland’s method can be used to resolve them. The minimax method, Schulze method and ranked pairs are other Condorcet‑consistent systems, each with its own mathematical rules and computational complexity. These methods are rarely used in parliamentary elections but appear in some civic organisations and online voting platforms.
孔多塞胜者是指在逐对对决中能击败所有其他候选人的候选人。孔多塞方法的目标是选出这样一位胜者（如果存在）。然而，孔多塞悖论表明，集体偏好可能出现循环：候选人 A 击败 B，B 击败 C，而 C 又击败 A，尽管每个个体选民的偏好都是可传递的。在矩阵形式中，逐对比较矩阵可能包含循环，这时可用波达计数法或科普兰法来解决。最小最大法、舒尔茨法和排序对法是其他符合孔多塞原则的系统，各有其数学规则和计算复杂度。这些方法在议会选举中很少使用，但会在一些民间组织和在线投票平台中见到。
8. Gerrymandering: Distortion Through Boundary Drawing | 杰利蝾螈：选区划分制造的扭曲
In representative democracies, the drawing of electoral district boundaries has a powerful mathematical dimension. Gerrymandering occurs when district lines are manipulated to favour a particular party, a tactic often executed by ‘packing’ opposition voters into a few districts or ‘cracking’ them across many districts to dilute their influence. Mathematically, this can be studied using measures such as the efficiency gap, which computes the difference between wasted votes for each party as a proportion of total votes. The symmetry standard and compactness tests, often based on isoperimetric quotients (area/perimeter²), provide analytical tools to detect and challenge biased districting. Recent court cases have increasingly relied on mathematical models to prove unconstitutional gerrymandering.
在代议制民主中，选区边界的划分具有强大的数学维度。杰利蝾螈是指操纵选区界线以偏袒某个党派的做法，常见手段是将对手选民“打包”塞进少数选区，或将其“打散”到多个选区以削弱其影响。从数学上看，这可以通过效率差距等指标来研究，效率差距计算的是两党浪费选票之差占总票数的比例。对称性标准和紧凑性检验（通常基于等周商 面积/周长²）为发现和挑战不公正的选区划分提供了分析工具。近年的法院判例中，越来越多的案件依靠数学模型来证明违宪的杰利蝾螈行为。
9. The Median Voter Theorem and Policy Convergence | 中间选民定理与政策趋同
A powerful result in political mathematics is the Median Voter Theorem. Under a one‑dimensional policy space with single‑peaked preferences and two candidates, the rational strategy for both candidates is to position themselves at the median voter’s ideal point, leading to policy convergence. Mathematically, if the distribution of voters along an ideological line is considered, the median is the position such that half the voters are to its left and half to its right. This theorem helps explain why major parties in first‑past‑the‑post systems often appear to move towards the centre. Extensions to multidimensional policy spaces and multiple candidates complicate the analysis, making equilibrium much harder to achieve and illustrating the mathematical richness behind political strategy.
政治数学中一个强有力的结论是中间选民定理。在一个一维政策空间、偏好为单峰的框架下，面对两名候选人，双方的最优策略都是站到中间选民的理想点上，从而导致政策趋同。从数学上看，如果沿着一条意识形态线看待选民的分布，中位数就是这样一个位置：一半选民在其左，一半在其右。这一定理有助于解释在简单多数制下主要政党为何常常向中间靠拢。而扩展到多维政策空间和多位候选人的情况时，分析会变得复杂，均衡极难达成，这也恰恰展现出政治策略背后的数学丰富性。
10. Referendums, Quorums and Supermajority Rules | 全民公投、法定人数与绝对多数规则
osal passes if yes votes > t × total votes. Quorums, on the other hand, require a minimum level of turnout. These rules can be modelled as two‑l constraints, making the mapping from voter preference to outcome more conservative. Game‑ic analysis shows that quorum rules can incentivise abstention strategies, as potential no‑ nt the quorum from being met, a strategic behaviour that can be quantified mathematically.
全民公投等直接民主工具常常采用绝对多数规则与参与法定人数要求。绝对多数要求提案获得超过简单多数的特定比例，例如 ⅔ 或 ¾ 的赞成票。从数学上看，这改变了决策规则中的阈值 t：提案通过当且仅当赞成票 > t × 总票数。而法定人数则要求一个最低投票率。这些规则可以建模为二维约束条件，使得从选民偏好到结果的映射更为保守。博弈论分析显示，法定人数规则可能激励弃权策略，因为潜在的反对者可能选择待在家中，以避免达到法定人数，这种策略行为完全可以用数学来量化。
11. Hybrid Systems and the Transferable Vote | 混合制与可转移投票
ats+1). Candidates achieving the quota are elected, and their surplus votes are transferred according to subsequent preferences. This continuous reallocation process can be studied as an iterative algorithm that converges to an equilibrium set of winners, reflecting a more refined aggregation of voter preferences than simple plurality. Mixed‑ st vote) and one for a party list (second vote), the latter providing the proportional top‑up to compensate for disproportionality in the single‑ n overdetermined system that sometimes requires leveling seats to restore proportionality.
许多当代民主国家采用混合制，融合了直接形式与代议形式。爱尔兰和马耳他实行的单一可转移投票制要求选民对候选人进行排序，并依据公式 quota = 1 + votes/(seats+1) 计算当选额度。达到额度的候选人当选，其多余选票按后续偏好转移。这一连续的再分配过程可视为一种迭代算法，最终收敛到一组均衡的当选者，比简单多数票更能精确地聚合选民偏好。而德国采用的联立制（混合成员比例代表制）使用双选票：一票投给选区候选人（第一票），一票投给政党名单（第二票），后者提供比例补偿以抵消单一席位选区的不成比例性。从数学上看，这是一个超定系统，有时需要增设补偿席位来恢复比例性。
12. A Mathematical Appreciation of Democratic Design | 民主设计的数学思维
The mathematical investigation of democratic systems reveals that no single voting method is perfect, and every choice involves trade‑offs between fairness, simplicity and stability. By studying concepts such as apportionment algorithms, power indices, paradoxes and impossibility theorems, students of A‑Level Mathematics gain not only technical competency in algorithms and discrete maths, but also a critical appreciation of how abstract mathematical properties translate into real political consequences. The interplay between direct and representative democracy is, at its core, a search for an optimal aggregation function — one that we are still refining with the help of mathematical reasoning.
对民主制度进行数学审视后可以发现，没有任何一种投票方法是完美无缺的，每一种选择都包含着公平、简洁与稳定之间的权衡。通过学习配额算法、权力指数、悖论和不可能定理等概念，A Level 数学学生不仅能掌握算法和离散数学的技术能力，还能对抽象的数学性质如何转化为真实的政治后果形成批判性的理解。直接民主与代议制民主之间的互动，本质上是在寻求一个最优的聚合函数——而这一探索，正是在数学推理的帮助下不断完善的。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图