Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Proportional Approval Method using Squared loads, Approval removal and Coin-flip approval transformation (PAMSAC) - a new system of proportional representation using approval voting (1602.05248v2)

Published 17 Feb 2016 in cs.GT

Abstract: Several multi-winner systems that use approval voting have been developed but they each suffer from various problems. Six of these methods are discussed in this paper. They are Satisfaction Approval Voting, Minimax Approval Voting, Proportional Approval Voting, Monroe's Fully Proportional Representation, Chamberlin-Courant's Rule, and Ebert's method. They all fail at least one of Proportional Representation (PR), strong PR, monotonicity or positive support. However, the new method described in this paper - Proportional Approval Method using Squared loads, Approval removal and Coin-flip approval transformation (PAMSAC) - passes them all. PAMSAC uses the squared loads of Ebert's method, but removes non-beneficial approvals to restore monotonicity. It also uses the Coin-Flip Approval Transformation (CFAT), where voters are "split" into two for each candidate they approve, and where one half of this split voter approves and the other half does not approve each candidate approved on the ballot. This restores positive support, and also makes the method equivalent to the D'Hondt party-list method for party voting. PAMSAC reduces to simple approval voting in the single-winner case. A score voting version is described that also reduces to simple score voting in the single-winner case.

Citations (5)

Summary

We haven't generated a summary for this paper yet.