[EM] A more elaborate version of Rob LeGrand's ballot by ballot

[Simmons, Forest]

A simpler version of this DSV idea follows:
 
1.  Initialize L(0) as the list of the ballots in random order. Let N be the number of ballots. For each i between one and N, inclusive, let L(i) be the tail of L(i-1).  In other words, each list is obtaind from the preceding by removing the first element (its head).
 
2. Initialize all entries to zero in  the candidate approval array A(0)
 
3. For j from 0 to N-1
 
       let A(j+1) = A(j)+P(A(j), L(j)).
 
  Next j
 
4.  Use A(N) to decide the winner.
 
What procedure P should be used in this algorithm?
 
Forest
 
 
 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/ms-tnef
Size: 4451 bytes
Desc: not available
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20060516/9669ac73/attachment-0002.bin>