Yesterday, I wrote about the Copeland score as a measure of an election system, and showed that the Borda Count can not have a winner with a Copeland score of 0. I made it fairly clear that allowing a Copeland score of 0 to win would be a bad thing, but I want to add some context to that.
Thus, I’ve written up a more complete exposition about the Copeland score. You’ll see that while having a high Copeland score is possible, the worst case scenario, even with Copeland-conscious systems, can be pretty bad.
Inside, I review the ideas of the Copeland score and Copeland n-vulnerability, then derive some bounds on vulnerability for voting systems. Next will be some more applied results, using simulations to look at these quantities. Comment below to add to the discussion!
-Barry


2 comments
Comments feed for this article
Trackback link
http://www.3stylelife.com/2008/09/23/facts-about-the-copeland-score/trackback/
10.6.08 at 4:49 pm
Pingback from Run Your Own Elections! | 3stylelife
10.10.08 at 6:31 pm
Pingback from The 41st Carnival of Mathematics « 360