The Ranked Choice Voting Game
This November, voters in Portland, Maine will elect their new mayor using a ranked-choice ballot. Voters will be able to rank as many as 15 candidates in their order of preference.
The ranked choice system will provide a lot of advantages over traditional elections, where you can only choose one candidate. No longer will we have to worry about the "spoiler effect" of third-party candidates: now, we can vote for Ralph Nader AND Al Gore.
Nevertheless, with fifteen candidates (and up to fifteen possible rankings to choose), the novelty of the ranked choice system is causing some confusion for local voters. It's difficult to explain the dynamics of a ranked-choice election in prose, and some attempts have been downright misleading.
So (and I'm puffing my chest out as I write this, because this represents my first substantial foray into practical programming) I've written a Ranked Choice Election simulation game to let people experience firsthand how a ranked choice election will work.
Fill out up to 50 different ballots as though they were coming from different voters. The program will then run through the Instant Runoff counting process, sequentially eliminating last-place contenders and explaining the process of reallocating the ballots along the way, until one winner crosses the crucial 50% threshold.
It may not look like much, but I spent many, many hours working on this over the summer and fall, so please consider leaving a tip if you find it useful (or, click often on our fossil fuel propagandist advertisers). I've tried my best to debug it across various browsers but it'll work best on Chrome, Safari, or Firefox, and don't bother if you're on a phone.
The ranked choice system will provide a lot of advantages over traditional elections, where you can only choose one candidate. No longer will we have to worry about the "spoiler effect" of third-party candidates: now, we can vote for Ralph Nader AND Al Gore.
Nevertheless, with fifteen candidates (and up to fifteen possible rankings to choose), the novelty of the ranked choice system is causing some confusion for local voters. It's difficult to explain the dynamics of a ranked-choice election in prose, and some attempts have been downright misleading.
So (and I'm puffing my chest out as I write this, because this represents my first substantial foray into practical programming) I've written a Ranked Choice Election simulation game to let people experience firsthand how a ranked choice election will work.
Fill out up to 50 different ballots as though they were coming from different voters. The program will then run through the Instant Runoff counting process, sequentially eliminating last-place contenders and explaining the process of reallocating the ballots along the way, until one winner crosses the crucial 50% threshold.
It may not look like much, but I spent many, many hours working on this over the summer and fall, so please consider leaving a tip if you find it useful (or, click often on our fossil fuel propagandist advertisers). I've tried my best to debug it across various browsers but it'll work best on Chrome, Safari, or Firefox, and don't bother if you're on a phone.
3 comments:
Nice work on this game!
One thing I'd recommend: not eliminate all candidates if there is a tie for last place. (For instance, if it is 40% to 30% to 30%, have some "random" way to break the tie). In real elections, ties are __very__ rare, of course, but can happen more easily with this simulation.
Pretty freakin' nifty! I made some initial attempts to do something similar using Excel but gave up early on since I couldn't get it to work well.
the following article from the NYT gives meat to your argument re affordable housing and smarter planning:
http://www.nytimes.com/2011/11/17/arts/design/jonathan-kirschenfeld-reimagines-the-sro-in-the-bronx.html?_r=1&nl=todaysheadlines&emc=tha28&pagewanted=all
Post a Comment