Scoring the CandidatesContinued from page 2
Warren Smith performed computer simulations using Bayesian regret analysis to compare election methods, measuring the quality of election outcomes by summing the utility--or satisfaction--of the voters. These simulations indicate that switching from plurality voting to range voting would improve election outcomes as much as switching from dictatorship to democracy would. Range voting also outperforms all common alternative systems on average--no matter how many honest, strategic, and uninformed voters cast their votes, and no matter how many candidates run. (See William Poundstone's Gaming the Vote for a good summary of this analysis.) Range voting using a 0 to 9 scale can be done on existing computerized or lever voting machines, punch cards, or paper ballots. Voters would simply select a score for each candidate. In fact, French researchers found that voters make fewer errors on range ballots than they do on plurality ballots. Changing the way the U.S. president is chosen may seem daunting, but plurality voting is a shaky foundation on which to rest the fate of the country. It doesn't let voters express how strongly they feel, which is a big drawback when some choices are much worse than others. Plagued by the prospect of spoilers and illogical outcomes, it perpetuates a two-party duopoly, minimizing democratic choice. IRV can't fix the problems of plurality voting. But computer simulations, Spartans, and trillions of generations of honeybees offer convincing evidence that range voting can. Alan T. Sherman, PhD '87, teaches computer science and is part of the National Center for the Study of Elections at the University of Maryland, Baltimore County. Warren D. Smith '84 cofounded the Center for Range Voting (rangevoting.org). Richard T. Carback III is a PhD candidate at the University of Maryland, Baltimore County. |









Tags
e-voting election range voting voting machine voting technology