> > Therefore, we finally have a monotone, clone free, DSV that
> takes rankings
> > as input, and puts out
> > rationally determined approval ballots.
> >
>
> Well, you'd have to impute the most popular ranking among a
> candidate'svoters to the candidate, and either use some direct
> approva
2011/7/6
> By the way, when the delegations are done sequentially, the optimum
> strategy for each player is
> (generically) deterministic. No mixed strategies are needed to get optimum
> game theoretic results.
>
Yes, that's the point.
>
> Because of this, a DSV (Delegated Strategy Voting) v
Yes, you are right!
Now I would like to suggest a way to make this method clone proof:
The key is to use the solid coalition structure of the factions to determine
the sequential order of play
(i.e. "delegation"), from largest coalition to smallest. I believe that
completely solves the proble
By the way, when the delegations are done sequentially, the optimum strategy
for each player is
(generically) deterministic. No mixed strategies are needed to get optimum
game theoretic results.
Because of this, a DSV (Delegated Strategy Voting) version would give the same
result as rationa
On 7/22/64 2:59 PM, Russ Paielli wrote:
...I eventually realized I was kidding myself to think that those
schemes will ever see the light of day in major public elections. What
is the limit of complexity that the general public will accept on a
large scale? I don't know, but I have my doubts th
2011/7/6 Andy Jennings
> Jameson,
>
> I have become confused about one point of operation in SODA. Take this
> scenario:
>
> 35 A>B>C
> 34 B>C>A
> 31 C>A>B
>
> If A delegates to A,B then does B have 69 votes he can delegate to B,C or
> does he have only 34 he can play with?
>
> In other words, c
Jameson,
I have become confused about one point of operation in SODA. Take this
scenario:
35 A>B>C
34 B>C>A
31 C>A>B
If A delegates to A,B then does B have 69 votes he can delegate to B,C or
does he have only 34 he can play with?
In other words, can votes delegated from one candidate to anothe
On 6.7.2011, at 6.42, Russ Paielli wrote:
> On Tue, Jul 5, 2011 at 2:14 AM, Juho Laatu wrote:
> On 5.7.2011, at 11.19, Russ Paielli wrote:
>
>> If one wants to simplify the inheritance rules even more then we might end
>> up using a tree method (I seem to mention it in every mail I send:). In t
