[EM] A class of determinsitic methods based on non-deterministic methods

[Simmons, Forest]

For every non-deterministic method M there is a deterministic method M' that elects the candidate most likely to win under method M.
 
For example, if M  is random ranked ballot, then M' is Plurality.
 
Suppose that M is random approval ballot. Then M' is the method that picks the candidate most likely to win under random approval ballot.
 
Has anybody considered this use of approval ballots?
 
Here's another method M using range ballots:
 
Pick two range ballots at random.  Find the highest range value r such that the ballots have at least one candidate in common among those rated at the level  r  or above.  If there are two or more candidates in common, then narrow down to one of them by random ballot(s).
 
M' is the method that picks the candidate with greatest probability of winning under M.
 
Forest
 
 
 
 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/ms-tnef
Size: 4420 bytes
Desc: not available
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20070103/2d6772f0/attachment-0002.bin>