Unsplit the Vote and Approval Voting sponsored the New Hampshire Liberty Forum 2019 put on annually by the Free State Project. Long-time Approval Voting activists Frank Atwood and Blake Huber flew out from Colorado.
Blake and Frank with perennial candidate Vermin Supreme
Unsplit the Vote and Approval Voting sponsored the New Hampshire Liberty Forum 2019 put on annually by the Free State Project. Long-time Approval Voting activists Frank Atwood & Blake Huber flew out from Colorado. Besides Approval Voting itself, they promoted the books Gaming the Vote and Honeybee Democracy.
Some 80% of the attendees already knew about Approval Voting. The high level of awareness no doubt reflected several past efforts. Since 2011, NH has seen four AV bills, including one this year.
Day 3 was the big one. Blake gave a brief presentation of Approval Voting to a lecture hall. Frank hosted the Legislative Cocktail Hour, and hobnobbed with NH legislators. Frank and Blake together had a 20-minute live-stream interview. It runs from about 1h 10m on the video that you can find on the Liberty Forum Facebook page: https://www.facebook.com/LibertyForum/videos/597443454106624/
There are three kinds of voting methods— allocative, comparative, and evaluative—based on the expression form and constraint. Allocative methods give each voter a fixed amount of “vote” (continuously divisible or as discrete tokens) to allocate among candidates. Comparative methods allow voters only to show preference between pairs of candidates; generally, this is done by ranking them. Evaluative methods have voters rate candidates independently on a scale (numeric or graded). There are also hybrids, e.g. multi-stage voting methods that combine voting methods of different categories.
A voting method is a set of rules that perform three sequential functions:
Balloting: enable individual voters to express their opinions in a uniform manner
Tallying: combine the opinions into a single list
Decision: based on decision thresholds or other consensus rules, produce a result
A voting method is just one (key) piece of a voting system: the complete, interconnected set of roles, tools, and processes that gather a group’s individual opinions and preferences and distill them into a single group decision. Voting methods can be implemented physically in many different ways. While voting methods are logical rules, they may lend themselves to various physical implementations that differ in criteria like simplicity or security.
There are three kinds of voting methods— allocative, comparative, and evaluative—based on the expression form and constraint. Allocative methods give each voter a fixed amount of “vote” (continuously divisible or as discrete tokens) to allocate among candidates. Comparative methods allow voters only to show preference between pairs of candidates; generally, this is done by ranking them. Evaluative methods have voters rate candidates independently on a scale (numeric or graded). There are also hybrids, e.g. multi-stage voting methods that combine voting methods of different categories.
Allocative voting methods are the oldest, going back at least 2000 years. The word “psephology” (election science) comes from the Greek word for “pebble”, “ostracize” from the Greek word for “pottery shard”, and “ballot” from the Italian word for “little ball”—all of these voting tokens could be dropped in a candidate’s urn. The phrase “to cast one’s vote for a candidate” (shortened to “to vote for”) assumes an allocative method, where the voters give their vote tokens to a candidate. You can read more about the etymology and history of voting from Oxford. Allocative methods include the common choose-one Plurality Voting, Top Two with Runoff, and Cumulative Voting, as well as the newer Asset Voting, Liquid Democracy, PLACE, and E Pluribus Hugo.
Allocative voting methods are simple, but inherently vulnerable to vote splitting. For that reason, a key trait of allocative methods is their reallocation rule, if no candidate (or not enough candidates, in multi-winner elections) has reached the threshold to win. Reallocation can be determined by the voters or the candidates, according to preferences expressed before or after initial balloting. For example, PLACE Voting has candidates declare their “heirs” before the election, while Asset Voting allows them to negotiate after the initial tallying. TTRO has a second round of voting. Choose-one Plurality Voting has no threshold (though it is also, inexplicably, called First Past the Post), and thus no reallocation rule.
Comparative voting methods became known just over 200 years ago, at the peak of the Enlightenment. Having voters rank their candidates was an obvious balloting improvement, but how to tally them was less obvious, and highly problematic. The simplest way (convert the rankings to summable points) turned out to be deeply flawed, and the better ways were still flawed, as well as complex. In 1972 Kenneth Arrow was awarded the Nobel Memorial Prize in Economic Sciences for his Impossibility Theorem showing that no comparative voting method could simultaneously satisfy several reasonable criteria. Ranked voting methods’ problems, paradoxes, and complexities have prevented them from being widely adopted.
Evaluative voting methods are the newest, arising over 20 years ago, in the wake of mass surveys, and later the Internet. People became accustomed to rating everything on Likert scales (strongly like, like, neutral, dislike, strongly dislike) or simple binary like-or-not scales. Such scales can also be used for voting, with two huge advantages: they sum easily, and they don’t split. Evaluative methods can be divided further into two categories: scored and graded. Scored methods use a numeric scale, and each candidate’s scores are summed. Graded methods use a scale with named grades, and each candidate’s grades are counted. More complex variants exist. Another name for evaluative voting methods is Range Voting, which you can read about at The Center for Range Voting.
Honeybees use an interesting evaluative voting method when choosing a new home. Scouts head out, find candidate nesting sites, return home, and “waggle dance” to show the location and quality of a candidate. The length of the dance corresponds to the bee’s assessment of the candidate’s quality. The longer the bee dances, the greater the chance that other bees will notice, go check out the site for themselves, and return home to share their opinion. Not all bees serve as scouts, and no bee checks out every candidate site—the swarm has to economize on time and energy. However, enough bees do participate, and eventually they reach a consensus, whereupon they up and move. In a fascinating case of engineering agreeing with evolution, a similar voting method was developed by voting theorist Jameson Quinn for the Webby Awards.
Thanks to the University of South Florida’s FCIT for a clipart element.
