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 el
Paul K. is going to think that I have too much time on my hands, since this
posting is strictly for theoretical purposes, namely to try to imagine how
close we might get to the "Small Voting Machine," the SMV that was posited by
Alex Small two or three years ago.
Here's a stab at the idea. Im
