Talk:Sequentially Shrinking Quota

It seems to me that this idea can be used with any sequential PR method? Any time you want to elect someone, check how many votes it costs to elect them, then simulate how the election would look if previous voters had only spent that much for each candidate they elected. BetterVotingAdvocacy (talk) 22:54, 23 January 2020 (UTC)

It is likely true that a method like this can be applied to many different systems. My understanding was that this was the name given to a specific implementation

v = number of voters
m = max possible score
q = quota
x = sum of score given to all the elected candidates elected by the current voter
y = sum of the total scores the elected candidates had when they were elected
   1. Set the quota size q to v * m.
   2. Decrease q until q = the total score given to one of the candidates when each ballot has a weight equal to 1 - x * q / y.
   3. Elect the candidate who's total score equals q
   4. Repeat steps 2-3 until all seats are filled.

If you look at the equation in step 2 this is Identical to https://electowiki.org/wiki/Sequentially_Spent_Score#Python_Implementation just with q fixed at as a Hare quota. It is really the subtraction which makes it similar to SSS. --Dr. Edmonds (talk) 18:44, 24 January 2020 (UTC)