📚 Legislatures: Congress and Parliament – A Mathematical Perspective | 立法机构：国会与议会——数学视角
Legislatures such as the US Congress and the UK Parliament are more than political institutions; they are rich systems of voting, apportionment, coalition-building, and strategic decision-making that can be rigorously analysed using A-level Mathematics. From counting votes to allocating seats and measuring power, mathematical models reveal the hidden structures of democratic processes. This article explores key concepts in decision mathematics, game theory, and discrete maths applied to legislatures, directly relevant to the Edexcel A-level syllabus.
美国国会和英国议会等立法机构不仅是政治实体，更是可以用A-level数学严格分析的投票、席位分配、联盟构建与策略决策系统。从计票到席位分配，再到衡量权力大小，数学模型揭示了民主过程背后的隐秘结构。本文探索决策数学、博弈论与离散数学在立法机构中的应用，与Edexcel A-level考纲直接相关。
1. Legislatures as Mathematical Systems | 作为数学系统的立法机构
A legislature can be modelled as a set of voters (legislators) who make decisions by casting votes. The rules of procedure define a function from individual preferences to a collective outcome. Mathematically, this is a social choice function. Understanding these functions lies at the heart of decision mathematics, a key part of the Edexcel A-level Further Maths or Decision Maths modules.
立法机构可被建模为一组投票者（议员），他们通过投票做出决定。议事规则定义了一个从个体偏好到集体结果的函数。在数学上，这就是社会选择函数。理解这些函数是决策数学的核心，也是Edexcel A-level进阶数学或决策数学模块的重要内容。
For example, in the UK House of Commons, 650 members vote on a bill. The simple majority rule requires at least 326 'Aye' votes. We can define a function f that maps a vector of votes to {pass, fail}. Similar models apply to the US Congress with 435 Representatives and 100 Senators.
例如，英国下议院有650名议员对法案投票。简单多数规则要求至少326票“赞成”。我们可以定义一个函数f，将投票向量映射到{通过，未通过}。类似模型适用于美国国会435名众议员和100名参议员。
2. Voting Systems: First-Past-the-Post and Proportional Representation | 投票制度：简单多数制与比例代表制
Electing legislators involves voting systems. The First-Past-the-Post (FPTP) system, used in UK general elections, awards a seat to the candidate with the most votes in each constituency. Mathematically, for constituency i with candidates {A, B, C}, the winner is argmax(votes). This can lead to disproportional outcomes where a party wins a majority of seats with a minority of total votes.
选举议员涉及投票制度。英国大选采用的简单多数制（FPTP），在每个选区将席位授予得票最多的候选人。数学上，对于选区i，候选人为{A, B, C}，胜出者为argmax(得票数)。这可能导致比例失调，一个政党获得少数总票数却赢得多数席位。
Proportional Representation (PR) aims to allocate seats so that each party's seat share mirrors its vote share. If party k receives vk votes out of V total, and there are S seats, the ideal seat allocation is sk = (vk / V) × S. Since sk is rarely integer, apportionment methods (discussed later) are used. Edexcel Decision Mathematics covers algorithms for fair allocation.
比例代表制（PR）旨在分配席位，使每个政党的席位比例反映其得票比例。若政党k获得V总票数中的vk票，且有S个席位，理想席位数为sk = (vk / V) × S。由于sk极少为整数，需使用分配方法（后述）。Edexcel决策数学涵盖公平分配的算法。
3. Arrow's Impossibility Theorem and Fairness Criteria | 阿罗不可能定理与公平标准
Kenneth Arrow proved that no ranked voting system can simultaneously satisfy a set of seemingly reasonable fairness criteria when there are three or more candidates. These criteria are: unrestricted domain (any preference order allowed), non-dictatorship, Pareto efficiency, and independence of irrelevant alternatives (IIA). This theorem is a cornerstone of social choice theory and can be introduced in A-level as an application of logical reasoning and proof.
肯尼思·阿罗证明，当有三个或更多候选人时，没有任何排序投票制能同时满足一组看似合理的公平标准。这些标准是：无限制域（允许任何偏好排序）、非独裁、帕累托有效和无关备选独立性（IIA）。这一定理是社会选择理论的基石，可作为逻辑推理与证明的应用在A-level中引入。
For instance, consider 3 legislators ranking proposals X, Y, Z. Using pairwise majority voting, we can encounter the Condorcet Paradox where X beats Y, Y beats Z, but Z beats X, creating a cycle. This demonstrates intransitivity of group preferences, a vital concept for understanding legislative deadlock.
例如，考虑3位议员对提案X、Y、Z排序。使用两两多数投票，可能遇到孔多塞悖论：X击败Y，Y击败Z，但Z击败X，形成循环。这显示了群体偏好的非传递性，是理解立法僵局的重要概念。
4. Apportionment Methods: Hamilton, Jefferson, and Webster | 议席分配方法：汉密尔顿法、杰斐逊法与韦伯斯特法
Apportionment deals with allocating a fixed number of seats to states or parties based on population or vote counts. This is typical in the US House of Representatives and in PR parliaments. Several methods exist, each with mathematical quirks. The Hamilton method (largest remainder) works as follows: calculate quota qi = (pop_i / total_pop) × S. Give each state floor(qi) seats. Distribute remaining seats to states with largest fractional parts.
议席分配涉及根据人口或得票数将固定数量的席位分配给各州或政党。这在美国众议院和比例代表制议会中很典型。存在多种方法，各有数学特性。汉密尔顿法（最大余数法）步骤如下：计算配额qi = (人口_i / 总人口) × S。给每个州floor(qi)个席位。将剩余席位分给小数部分最大的州。
The Jefferson method (d' at sum(floor(pop_i / D)) = S. This favours larger parties. The Webster method (Sainte-Laguë ration. The Alabama paradox, where increasing total seats causes a state to lose a seat, reveals flaws in the Hamilton method.
杰斐逊法（d'Hondt）使用除数D使得sum(floor(人口_i / D)) = S。这有利于大党。韦伯斯特法（Sainte-Laguë）使用除数和四舍五入取整，sum(round(人口_i / D)) = S。这些方法在决策数学中作为涉及迭代的算法来学习。阿拉巴马悖论——增加总席位反而导致某州失去一个席位——揭示了汉密尔顿法的缺陷。
5. The Mathematics of Gerrymandering | 不公正划分选区的数学
Gerrymandering is the manipulation of electoral district boundaries to favour a party. Mathematically, it can be analysed using geometry, graph partitioning, and efficiency gap measures. In the US Congress, districts are redrawn every 10 years. The efficiency gap is defined as (wasted votes for party A − wasted votes for party B) / total votes, where wasted votes are those beyond what is needed to win. A large gap indicates partisan bias.
不公正划分选区是通过操纵选区边界以利于某党。数学上，可用几何、图划分和效率差度量来分析。在美国国会，选区每10年重划一次。效率差定义为（A党浪费的票数 − B党浪费的票数）/ 总票数，浪费的票指超过获胜所需的票。差值大表明党派偏向。
We can model a state as a grid of voters. Using algorithms like the shortest splitline method, we seek compact districts. This connects to graph theory: the state is a planar graph, and districts are connected subgraphs. Edexcel A-level students encounter algorithms that can be adapted to this context, such as Kruskal's and Prim's for spanning trees, aiding understanding of district connectivity.
我们可以将州建模为选民的网格。使用最短分割线法等算法，寻求紧凑的选区。这与图论相关：州是平面图，选区是连通子图。Edexcel A-level学生会遇到可适配于此的算法，如克鲁斯卡尔和普里姆算法用于生成树，有助于理解选区连通性。
6. Coalition Formation and Game Theory | 联盟形成与博弈论
l a majority of seats. The characteristic function v(S) = 1 if coalition S has at least 50% the core are solution concepts determining fair power distribution and stable coalitions.
在许多议会中，无一党获得绝对多数，因此必须组建联盟。这是一种合作博弈，参与者（政党）结盟以控制多数席位。特征函数v(S)=1若联盟S拥有至少50%+1席位，否则为0。沙普利值和核是确定公平权力分配和稳定联盟的解概念。
ng coalition needs ≥ 51 seats. Minimal winning coalitions are: A+B (70), A+C (60), A+D (50 – not winning unless D's 10 pushes to 50? =60 winning, etc. This analysis uses combinatorial sets, an ideal topic for Further Maths.
考虑一个100席议会：A党40席，B党30席，C党20席，D党10席。获胜联盟需要≥51席。最小获胜联盟有：A+B(70)，A+C(60)，B+C+D(60)等。这里需要组合集合分析，是进阶数学的理想主题。
7. Power Indices: Shapley-Shubik and Banzhaf | 权力指数：沙普利-舒比克指数与班扎夫指数
In weighted voting bodies like the US Electoral College or the EU Council of Ministers, each member has a number of votes. Power indices quantify a member's ability to change outcomes. The Shapley-Shubik index computes the proportion of permutations of players in which the player is pivotal. The Banzhaf index counts the number of winning coalitions in which a player's defection would make it lose.
在美国选举人团或欧盟部长理事会等加权投票机构中，每个成员有一定票数。权力指数量化成员改变结果的能力。沙普利-舒比克指数计算在玩家的所有排列中，该玩家成为关键者的比例。班扎夫指数计算玩家若退出会使获胜联盟变为失败的联盟数目。
Example: A simple weighted voting game [51; 40, 30, 20, 10]. The Banzhaf power index for each party can be calculated by listing all winning coalitions and identifying critical players. Party A with 40 votes is critical in coalitions {A,B}, {A,C}, {A,B,C} (maybe others). This demonstrates that seats alone do not reflect true power; mathematics gives a more nuanced picture.
例子：一个简单的加权投票博弈[51; 40,30,20,10]。各党的班扎夫权力指数可通过列出所有获胜联盟并识别关键玩家来计算。拥有40票的A党在联盟{A,B}、{A,C}、{A,B,C}等中是关键的。这表明席位本身并不反映真实权力；数学提供了更细致的图景。
8. Decision Making in Committees: Weighted Voting and Thresholds | 委员会决策：加权投票与阈值
ommittees and parliamentary select committees often use weighted voting, where each member's vote carries a weight. The decision rule is typically a quota: if sum of weights of 'yes' voters ≥ Q, motion passes. This is a threshold function. In binary terms, let wi be weight of member i, and let vote xi ∈ {0,1}. Outcome is 1 if Σ wi xi ≥ Q, else 0. This is a linear threshold Boolean function.
国会委员会和议会专责委员会常使用加权投票，每位成员的票带有权重。决策规则通常为定额：若投“赞成”者的权重之和≥Q，则动议通过。这是一个阈值函数。用二进制表示，设成员i的权重为wi，投票xi ∈ {0,1}。若Σ wi xi ≥ Q则结果为1，否则为0。这是一个线性阈值布尔函数。
The study of such functions intersects with Boolean algebra and logic circuits, topics in Further Pure. Moreover, the concept of a dummy player – one whose weight never affects the outcome – can be identified by checking if for every winning coalition containing the player, removing them still leaves it winning. This is an exercise in critical thinking using sets.
这类函数的研究与布尔代数和逻辑电路交叉，属于进阶纯数主题。此外，虚设玩家——其权重从不影响结果——可通过检查每个包含该玩家的获胜联盟，移除后是否仍为获胜联盟来识别。这是运用集合进行批判性思维的练习。
9. Graph Theory Models of Legislative Processes | 立法过程的图论模型
A bill's journey through Congress or Parliament can be modelled as a directed graph (network). Nodes represent stages (e.g., First Reading, Committee Stage, Report Stage, Third Reading, Conference Committee), and arcs represent possible transitions. The critical path can be determined using critical path analysis (CPA) from Decision Maths, helping to schedule debate and amendments efficiently.
法案在国会或议会中的旅程可建模为有向图（网络）。节点代表各阶段（如一读、委员会审议、报告阶段、三读、协商委员会），弧代表可能的转移。关键路径可使用决策数学中的关键路径分析（CPA）来确定，有助于高效排定辩论和修正案的日程。
Furthermore, bipartite graphs can model the relationship between legislators and the bills they sponsor or vote on, allowing for cluster analysis to reveal voting blocs. Matrix operations on adjacency matrices give insights into connectivity and influence. This links to the Edexcel topic of matrices in Further Maths.
此外，二分图可建模议员与其提出或投票的法案之间的关系，通过聚类分析揭示投票集团。对邻接矩阵的矩阵运算可洞察连通性与影响力。这与Edexcel进阶数学中的矩阵主题相联系。
10. Strategic Voting and the Condorcet Paradox | 策略性投票与孔多塞悖论
Legislators often vote strategically, not sincerely. In game theory, this is analysed using normal-form games. Suppose a legislature votes on an amendment and then the main bill. A legislator might vote against their true preference on the amendment to get a more favourable final outcome. This is strategic voting, leading to equilibria like the voting paradox or the poison pill amendment.
议员常策略性投票，而非真诚投票。在博弈论中，用正则形式博弈分析。假设立法机构先对一个修正案投票，再对主法案投票。议员可能对修正案投下与自己真实偏好相反的票，以获得更有利的最终结果。这就是策略性投票，导致投票悖论或毒丸修正案等均衡。
The Condorcet Paradox, where majority preferences cycle, can be expressed using preference matrices. For three alternatives, the aggregated preference matrix may show that each alternative loses to another by a majority, leaving no clear winner. The Copeland method scores alternatives by number of pairwise wins, offering a way to resolve cycles. These topics develop the skill of reasoning with matrices and ordering algorithms.
多数偏好循环的孔多塞悖论可用偏好矩阵表示。对于三个备选方案，汇总偏好矩阵可能显示每个方案都以多数票输给另一个，无明确胜者。科普兰法通过两两比较获胜次数给方案打分，提供了一种解决循环的方法。这些话题培养运用矩阵和排序算法推理的能力。
11. Exam-Style Application and Tips | 考试风格的应用与技巧
Edexcel A-level Decision Mathematics papers often feature questions on algorithms, networks, and game theory that can be directly related to legislative contexts. When solving apportionment problems, always state the method used and check for paradoxes. For power indices, systematically list all winning coalitions and permutations. Use clear notation like Σ for sums, and remember the quota Q must be stated.
Edexcel A-level决策数学试卷常出现算法、网络和博弈论问题，可直接与立法情境关联。解分配问题时，务必申明所用方法并检查悖论。对于权力指数，系统列出所有获胜联盟和排列。使用Σ等清晰符号，并牢记定额Q必须写明。
For graph theory questions, draw the network accurately and use standard algorithms like Dijkstra's for shortest path (representing quickest route for a bill). Practice interpreting power indices in terms of real political influence. By framing abstract maths within legislatures, you enhance both understanding and ability to tackle context-based exam questions.
处理图论问题时，准确绘制网络，并使用标准算法如迪杰斯特拉算法求最短路径（代表法案通过的最快路径）。练习从实际政治影响力角度解读权力指数。通过将抽象数学置于立法机构框架内，既能加深理解，又能提高应对情境化考题的能力。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图