Distributed Voting: Difference between revisions

no edit summary
(Seats management added)
No edit summary
Line 116:
* If the remaining candidates are contained in a [[Smith set]], then the candidates with the highest sum wins.
 
==Seats assignmentallocation==
 
The Distributed Voting indicates the method for obtaining single or multiple winners. The Distributed Voting System also describes how seats should be handled.
Line 135:
Seats weight: A[0.4] B[0.35] C[0.25]
 
Fractional seats offer better proportionality than unit seats, but there is a risk that a candidate alone will gain more than 5150% of the power. The formula indicated for S serves to ensure that a single candidate cannot have a majority on his own, while maintaining the benefits of fractional seats. The effectiveness of these properties is noted with increasing seats.
 
Example - 10 winners
Line 154:
# all candidates have a % of victory greater than or equal to S.
* 1 seat is assigned to each party (if there is a party that has obtained more than 50%, it will receive 2 seats).
* If seats remain to be filled, they distribute according to % of the party victory, using a method of your choice (as %%%,[[D'Hondt %%%, ...method]]).
* dividing the % of victory of the parties by the number of seats they have, the fractional weight of each seat is obtained.
 
Line 186:
 
Total difference: 5.3% + 3.2% + 8.3% + 6% = 22.8%
An average error of 5.7% each candidate. The more seats and districts increase, the more the error increasescan increase.
 
The size of the district is represented only by the power it possesses and which will be assigned proportionally to the seats, therefore it's not strange that two districts of different sizes can still have the same number of seats (with different weight).
206

edits