![]() |
Re: MeeGo Coding Competition 2011
Can we use the council election method recursively?
How about something like that: while there are candidates left: Run the election method for one seat Push back the elected candidate in the final ranking list Remove the candidate from the election (ie remove from ranked, voting lists) loop. Probably ineficient and may not be the fairest method, but it has the advantage of being feasible? |
Re: MeeGo Coding Competition 2011
Quote:
Code:
$ openstv-run-election -s 9 FTSTV network.blt OpenSTV version 1.6.1 (http://www.OpenSTV.org/) |
Re: MeeGo Coding Competition 2011
Quote:
|
Re: MeeGo Coding Competition 2011
I'm on the opinion, although it will probably be more work.
1. Run council election algorithm an category 2. Winner is winner of first place 3. Remove winner app from all votes 4. Repeat process until all positions are filled. Repeat all this for all categories. |
Re: MeeGo Coding Competition 2011
Can we run the system from the last election and 'toss a coin' (randomly select) the winner if there are ties?
This would be consistent and the random element I guess is just life! |
Re: MeeGo Coding Competition 2011
Quote:
We need IMHO something OpenSTV is able to produce itself. Just out of the box... What about this method: http://www.openstv.org/borda-count Quote:
|
Re: MeeGo Coding Competition 2011
Quote:
Sorry, but I guess I don't get it... |
Re: MeeGo Coding Competition 2011
Quote:
|
Re: MeeGo Coding Competition 2011
Quote:
|
Re: MeeGo Coding Competition 2011
Quote:
Is the Software OpenSTV able to produce something like this just out of the box? This would make your result a little bit more official if Nemein would count the votes. Edit: Seen your answer now. I was not fast enought while writing. I know about your script. Thanks! :) - Do you know the OpenSTV Software? |
| All times are GMT. The time now is 01:15. |
vBulletin® Version 3.8.8