On 4.8.2011, at 2.09, Jameson Quinn wrote: > Free riding in some form is inevitable in a good system. (That is, any system > which avoids free riding entirely would be horribly warped by that necessity).
How about tree methods? If candidates are ordered as a binary tree (instead of an open list), then there are no choices between three or more branches, and related free riding becomes impossible. Juho ---- Election-Methods mailing list - see http://electorama.com/em for list info