Arrow, K. J. 1951. Social Choice and Individual Values. Yale University Press, second edition.Google Scholar
Aslam, J. A., R. A. Popa, and R. L. Rivest. 2007. “On Estimating the Size and Confidence of a Statistical Audit.” Martinez, R. and D. Wagner, eds. Proceedings of EVT 2007, USENIX and ACCURATE. 8–8.Google Scholar
Aslam, J. A., R. A. Popa, and R. L. Rivest. 2008. “On Auditing Elections When Precincts Have Different Sizes.” in D. Dill and T. Kohno, eds., Proceedings of EVT 2008, USENIX and ACCURATE, 1–1.Google Scholar
Australian Electoral Commission 2011. “Counting the Votes – House of Representatives.” (http://www.aec.gov.au/Voting/counting/vid_hor.htm).
Baldwin, J. M. 1926. “The Technique of the Nanson Preferential Majority System of Election.” Proceedings of the Royal Society of Victoria 39:42–52.Google Scholar
Bartholdi III, J. J. and J. B. Orlin. 1991. “Single Transferable Vote Resists Strategic Voting.” Social Choice and Welfare 8:341–54.Google Scholar
Benaloh, J., D. Jones, E. L. Lazarus, M. Lindeman, and P. B. Stark. 2011. “SOBA: Secrecy-Preserving Observable Ballot-Level Audit.”in Shacham, H. and V. Teague, eds. Proceedings of EVT/WOTE 2011, USENIX, ACCURATE, and IAVoSS.Google Scholar
Betzler, N., R. Niedermeier, and G. J. Woeginger. 2011. “Unweighted Coalitional Manipulation Under the Borda Rule is NP-hard.” in Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, 55–60 (http://ijcai.org/papers11/Papers/IJCAI11-021.pdf).
Black, D. 1958. The Theory of Committees and Elections. Cambridge: Cambridge University Press.Google Scholar
Brams, S. J. and P. C. Fishburn. 1983. Approval Voting. Cambridge, MA: Birkhäuser Boston.Google Scholar
Brams, S. J. and P. C. Fishburn. 2005. “Going from Theory to Practice: The Mixed Success of Approval Voting.” Social Choice and Welfare 25:457–474 (http://dx.doi.org/10.1007/s00355-005-0013-y).Crossref
Brelsford, E., P. Faliszewski, E. Hemaspaandra, H. Schnoor, and I. Schnoor. 2008. “Approximability of Manipulating Elections.” in D. Fox and C. P. Gomes, eds., AAAI, AAAI Press, 44–49.Google Scholar
Calandrino, J. A., J. A. Halderman, and E. W. Felten. 2007. “Machine-Assisted Election Auditing.” in Martinez, R. and D. Wagner, eds. Proceedings of EVT 2007, USENIX and ACCURATE.Google Scholar
Checkoway, S., A. Sarwate, and H. Shacham. 2010. “Single-Ballot Risk-Limiting Audits Using Convex Optimization.” in Jones, D., J.-J. Quisquater, and E. Rescorla, eds. Proceedings of EVT/WOTE 2010, USENIX, ACCURATE, and IAVoSS.Google Scholar
Consortium for Elections and Political Process Strengthening 2011. “ElectionGuide.” (http://www.electionguide.org/).
Davies, J., G. Katsirelos, N. Narodytska, and T. Walsh. 2011. “Complexity of and Algorithms for Borda Manipulation.” in Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence.Google Scholar
Dopp, K. 2008. “History of Confidence Election Auditing Development (1975 to 2008) & Overview of Election Auditing Fundamentals.” (http://electionmathematics.org/ucvAnalysis/US/paperaudits/History-of-Election-Auditing-Development.pdf, online).
Doron, G. and R. Kronick. 1977. “Single Transferable Vote: An Example of a Perverse Social Choice Functioned.” American Journal of Political Science 21:303–311. (http://www.jstor.org/stable/2110496).Crossref
Dummett, M. 1984. Voting Procedures, Clarendon: Oxford.Google Scholar
Faliszewski, P., E. Hemaspaandra, and L. A. Hemaspaandra. 2011. “Multimode Control Attacks on Elections.” Journal of Artificial Intelligence Research 40:305–351. (http://dx.doi.org/10.1613/jair.3136).Crossref
Farvaque, E., H. Jayet, and L. Ragot. 2009. “A “Winner” Under Any Voting Rule ? an Experiment on the Single Transferable Vote.” Documents de travail du Centre d’Economie de la Sorbonne 09067, Université Panthéon-Sorbonne (Paris 1), Centre d’Economie de la Sorbonne.Google Scholar
Hill, I. D. 2004. “An Odd Feature in a Real STV Election.” Voting Matters 18:9.Google Scholar
Isaksson, M., G. Kindler, and E. Mossel. 2010. “The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite Theorem.” in FOCS, IEEE Computer Society 319–328. (http://dx.doi.org/).
Jones, D., J.-J. Quisquater, and E. Rescorla, eds. 2010. Proceedings of EVT/WOTE 2010, USENIX, ACCURATE, and IAVoSS.Google Scholar
Kaplan, H. M. 1987. “A Method of One-Sided Nonparametric Inference for the Mean of a Nonnegative Population.” The American Statistician 41:157–158. (http://dx.doi.org/10.1080/00031305.1987.10475470).Crossref
Magrino, T. R., R. L. Rivest, E. Shen, and D. Wagner. 2011. “Computing the Margin of Victory in IRV elections.” in Shacham, H. and V. Teague, eds. Proceedings of EVT/WOTE 2011, USENIX, ACCURATE, and IAVoSS.Google Scholar
Martinez, R. and D. Wagner, eds. 2007. Proceedings of EVT 2007, USENIX and ACCURATE.Google Scholar
Nanson, E. J. 1882. “Methods of election.” Transactions and Proceedings of the Royal Society of Victoria 18:197–240.Google Scholar
Neff, C. A. 2003. “Election Confidence: A Comparison of Methodologies and their Relative Effectiveness at Achieving it (revision 6).” (www.verifiedvoting.org/downloads/20031217.neff.electionconfidence.pdf).
O’Neill, J. 2006. “Fast Algorithms for Counting Ranked Ballots.” Voting Matters 21:1–5.Google Scholar
Poundstone, W. 2008. Gaming the Vote: Why Elections Aren’t Fair (and What We Can Do About It). New York: Hill and Wang. ISBN 978-0-8090-4892-2.Google Scholar
Procaccia, A. D. and J. S. Rosenschein. 2007. “Junta Distributions and the Averagecase Complexity of Manipulating Elections.” Journal of Artificial Intelligence Research 28:157–181. (http://dx.doi.org/10.1613/jair.2148).Crossref
Roberts, S. 2010. “Minor Parties See Threat in Ballot Quirk.” The New York Times, October 26, A24.Google Scholar
Saari, D. 1995. Basic Geometry of Voting, Berlin: Springer.Google Scholar
Saari, D. G. 2001. Decisions And Elections: Explaining The Unexpected. Cambridge, UK: Cambridge University Press.Google Scholar
Saltman, R. G. 1975. “Effective use of computing technology in vote-tallying.” Technical Report Tech. Rep. NBSIR 75–687, National Bureau of Standards (Information Technology Division), Washington, D.C., USA. (URL http://csrc.nist.gov/publications/nistpubs/NBS_SP_500-30.pdf).
San Francisco Voting Systems Task Force 2011. “Recommendations on Voting Systems for the City and County of San Francisco (draft).” (http://www.sfgov2.org/Modules/ShowDocument.aspx?documentid=155).
Satterthwaite, M. A. 1975. “Strategy-Proofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting and Social Welfare Functions.” Journal of Economic Theory 10:187–217.CrossrefGoogle Scholar
Schulze, M. 1997. “Condorect Sub-Cycle Rule.” The Election-Methods Mailing List. (http://lists.electorama.com/pipermail/electionmethods-electorama.com/1997-October/001570.html).
Schulze, M. 2011. “A New Monotonic, Clone-Independent, Reversal Symmetric, and Condorcet-Consistent Single-Winner Election Method.” Social Choice and Welfare 36:267–303. (http://dx.doi.org/10.1007/s00355-010-0475-4).Crossref
Shacham, H. and V. Teague, eds. 2011. Proceedings of EVT/WOTE 2011, USENIX, ACCURATE, and IAVoSS.Google Scholar
Stanislevic, H. 2006. “Random Auditing of E-Voting Systems: How Much is Enough?” (http://www.votetrustusa.org/pdfs/VTTF/EVEPAuditing.pdf).
Stark, P. B. 2008b. “Election Audits by Sampling with Probability Proportional to an Error Bound: dealing with Discrepancies.” (http://www.stat.berkeley.edu/∼stark/Preprints/ppebwrwd08.pdf, draft).
Stark, P. B. 2009a. “Auditing a Collection of Races Simultaneously.” (URL http://arxiv.org/abs/0905.1422v1, arXiV Preprint arXiv:0905.1422v1 [stat.AP]).
Stark, P. B. 2009c. “Efficient Post-Election Audits of Multiple Contests: 2009 California tests.” in Proceedings of the 4th Annual Conference on Empirical Legal Studies. (http://dx.doi.org/10.2139/ssrn.1443314).Crossref
Stark, P. B. 2009d. “Risk-Limiting Postelection Audits: Conservative P-Values from Common Probability Inequalities.” IEEE Transactions on Information Forensics and Security 4:1005–1014. (http://dx.doi.org/10.1109/TIFS.2009.2034190).Crossref
Stark, P. B. 2010. “Super-Simple Simultaneous Single-Ballot Risk-Limiting Audits.” in Jones, D., J.-J. Quisquater, and E. Rescorla, eds. Proceedings of EVT/WOTE 2010, USENIX, ACCURATE, and IAVoSS.Google Scholar
Sturton, C., E. Rescorla, and D. Wagner. 2009. “Weight, Weight, Don’t Tell Me: Using Scales to Select Ballots for Auditing,” in D. Jefferson, J. L. Hall, and T. Moran, eds., Proceedings of EVT/WOTE 2009, USENIX, ACCURATE, and IAVoSS.Google Scholar
Szpiro, G. 2010. Numbers Rule: The Vexing Mathematics Of Democracy, From Plato To The Present. Princeton, NJ: Princeton University Press.Google Scholar
The Heisman Memorial Trophy 2011. “Heisman Trophy Balloting.” (http://www.heisman.com/history/balloting.php).
About the article
Published Online: 2013-01-11
Wikipedia lists 60 organizations which use the Schulze Method in some form. http://en.wikipedia.org/w/index.php?title=Schulze_method&oldid=434396935#Use_of_the_Schulze_method. Accessed 2011-06-15.
This is Hare’s rule for ballot transfers (Tideman 1995).
San Francisco allows voters to rank no more than three of the candidates for each race.
In a presentation at the EVN 2011 conference, Emily Shen gave another such example.
A simpler form of auditing simply recounts ballots to confirm the winner, called a ballot polling audit in Lindeman and Stark (2012).
The remainder of this subsection is adapted from the authors’ earlier work on risk-limiting, post-election audits (Checkoway, Sarwate, and Shacham, 2010).
Intermediate sub-precinct audit units, such as individual voting machines, appear to provide littlegain in statistical power, but may reduce the cost of locating the ballots to audit.
This is not without loss of generality—if more information is known about the reported margins,more targeted sampling can be more efficient (Stark 2009b).
To use ɛ in Definition 3, the ballots must first be converted from ordered lists to pairs of scores: (1,2), (1) → (1,0); (2,1), (2) → (0,1); and ( ) → (0,0) which is to say that only the top-ranked candidate on the ballot gets a score of 1.
S.F., Cal., Charter art. XIII, § 13.102(e) (Mar. 2002), “If the total number of votes of the two or more candidates credited with the lowest number of votes is less than the number of votes credited to the candidate with the next highest number of votes, those candidates with the lowest number of votes shall be eliminated simultaneously and their votes transferred to the next-ranked continuing candidate on each ballot in a single counting operation.”
For example, with the base IRV elimination rule, if the two candidates with the fewest number of top-choice votes in a round have the same number of votes, then the candidate to be eliminated may be chosen by some other mechanism such as a coin flip.
All of our code is available at https://www.cs.jhu.edu/∼s/elections/irv.html.
A priority queue is an abstract data type which is conceptually a set of elements each of which has an associated priority. Common implementations of priority queues support fast insertion of a new element with arbitrary priority and fast removal of the element with the highest priority.
Cf., Ala. Code §17-16-20 (2010) or Fla. Stat. §102.141 (2010).
I. D. Hill describes a slightly different example of instability in a real Single Transferable Vote election—the multiseat analogue of instant-runoff voting. Hill points out that a change in a single ballot’s 15th choice (out of 23) would result in a different winner. In this case, it was the difference between voting for one of the (eventual) winners and the closest runner up rather than between two losers (Hill 2004).