相关论文: A Mathematical Analysis of an Election System Prop…

The election methods introduced in 1894--1895 by Phragm\'en and Thiele, and their somewhat later versions for ordered (ranked) ballots, are discussed in detail. The paper includes definitions and examples and discussion of whether the…

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve…

We study a method for proportional representation that was proposed at the turn from the nineteenth to the twentieth century by Gustav Enestr\"om and Edvard Phragm\'en. Like Phragm\'en's better-known iterative minimax method, it is assumed…

We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each…

We propose a new single-winner election method ("Schulze method") and prove that it satisfies many academic criteria (e.g. monotonicity, reversal symmetry, resolvability, independence of clones, Condorcet criterion, k-consistency,…

Apportionment is the problem of distributing $h$ indivisible seats across states in proportion to the states' populations. In the context of the US House of Representatives, this problem has a rich history and is a prime example of…

In the late 19th century, Swedish mathematician Lars Edvard Phragm\'{e}n proposed a load-balancing approach for selecting committees based on approval ballots. We consider three committee voting rules resulting from this approach: two…

We investigate two systems of fully proportional representation suggested by Chamberlin Courant and Monroe. Both systems assign a representative to each voter so that the "sum of misrepresentations" is minimized. The winner determination…

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…

U.S. presidential elections are decided by the Electoral College, established in 1789, and designed to mitigate potential risks arising from the collusion of large groups of citizens. A statewide winner-take-all popular voting system for…

Apportionment is the act of distributing the seats of a legislature among political parties (or states) in proportion to their vote shares (or populations). A famous impossibility by Balinski and Young (2001) shows that no apportionment…

We study two influential voting rules proposed in the 1890s by Phragm\'en and Thiele, which elect a committee or parliament of k candidates which proportionally represents the voters. Voters provide their preferences by approving an…

Elections are the central institution of democratic processes, and often the elected body -- in either public or private governance -- is a committee of individuals. To ensure the legitimacy of elected bodies, the electoral processes should…

In parliamentary elections, parties compete for a limited, typically fixed number of seats. Most parliaments are assembled using apportionment methods that distribute the seats based on the parties' vote counts. Common apportionment methods…

In many proportional parliamentary elections, electoral thresholds (typically 3-5%) are used to promote stability and governability by preventing the election of parties with very small representation. However, these thresholds often result…

The paper considers a general model of electoral systems combining district-based elections with a compensatory mechanism in order to create any outcome between strictly majoritarian and purely proportional seat allocation. It contains vote…

The efficiency gap formula was introduced in to measure political gerrymandering. It played a key role in the Gill v. Whitford case whose appeal is currently before the Supreme Court, but it was very recently shown by Bernstein and Duchin…

In the apportionment problem, a fixed number of seats must be distributed among parties in proportion to the number of voters supporting each party. We study a generalization of this setting, in which voters can support multiple parties by…

Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in…

The major finding, of this article, is an ensemble method, but more exactly, a novel, better ranked voting system (and other variations of it), that aims to solve the problem of finding the best candidate to represent the voters. We have…