Single-Winner Voting Method Comparison Chart
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Critical Strategies Under Approval Voting: Who Gets Ruled in and Ruled Out
Critical Strategies Under Approval Voting: Who Gets Ruled In And Ruled Out Steven J. Brams Department of Politics New York University New York, NY 10003 USA [email protected] M. Remzi Sanver Department of Economics Istanbul Bilgi University 80310, Kustepe, Istanbul TURKEY [email protected] January 2005 2 Abstract We introduce the notion of a “critical strategy profile” under approval voting (AV), which facilitates the identification of all possible outcomes that can occur under AV. Included among AV outcomes are those given by scoring rules, single transferable vote, the majoritarian compromise, Condorcet systems, and others as well. Under each of these systems, a Condorcet winner may be upset through manipulation by individual voters or coalitions of voters, whereas AV ensures the election of a Condorcet winner as a strong Nash equilibrium wherein voters use sincere strategies. To be sure, AV may also elect Condorcet losers and other lesser candidates, sometimes in equilibrium. This multiplicity of (equilibrium) outcomes is the product of a social-choice framework that is more general than the standard preference-based one. From a normative perspective, we argue that voter judgments about candidate acceptability should take precedence over the usual social-choice criteria, such as electing a Condorcet or Borda winner. Keywords: approval voting; elections; Condorcet winner/loser; voting games; Nash equilibrium. Acknowledgments. We thank Eyal Baharad, Dan S. Felsenthal, Peter C. Fishburn, Shmuel Nitzan, Richard F. Potthoff, and Ismail Saglam for valuable suggestions. 3 1. Introduction Our thesis in this paper is that several outcomes of single-winner elections may be socially acceptable, depending on voters’ individual views on the acceptability of the candidates. -
A Generalization of the Minisum and Minimax Voting Methods
A Generalization of the Minisum and Minimax Voting Methods Shankar N. Sivarajan Undergraduate, Department of Physics Indian Institute of Science Bangalore 560 012, India [email protected] Faculty Advisor: Prof. Y. Narahari Deparment of Computer Science and Automation Revised Version: December 4, 2017 Abstract In this paper, we propose a family of approval voting-schemes for electing committees based on the preferences of voters. In our schemes, we calcu- late the vector of distances of the possible committees from each of the ballots and, for a given p-norm, choose the one that minimizes the magni- tude of the distance vector under that norm. The minisum and minimax methods suggested by previous authors and analyzed extensively in the literature naturally appear as special cases corresponding to p = 1 and p = 1; respectively. Supported by examples, we suggest that using a small value of p; such as 2 or 3, provides a good compromise between the minisum and minimax voting methods with regard to the weightage given to approvals and disapprovals. For large but finite p; our method reduces to finding the committee that covers the maximum number of voters, and this is far superior to the minimax method which is prone to ties. We also discuss extensions of our methods to ternary voting. 1 Introduction In this paper, we consider the problem of selecting a committee of k members out of n candidates based on preferences expressed by m voters. The most common way of conducting this election is to allow each voter to select his favorite candidate and vote for him/her, and we select the k candidates with the most number of votes. -
1 Introduction 2 Condorcet and Borda Tallies
1 Introduction General introduction goes here. 2 Condorcet and Borda Tallies 2.1 Definitions We are primarily interested in comparing the behaviors of two information aggregation methods, namely the Condorcet and Borda tallies. This interest is motivated by both historical and practical concerns: the relative merits of the two methods have been argued since the 18th century, and, although variations on the Borda tally are much more common in practice, there is a significant body of theoretical evidence that the Condorcet tally is in many cases superior. To begin, we provide formal definitions of both of these methods, and of a generalized information aggregation problem. An information aggregation problem, often referred to simply as a voting problem, is a problem which involves taking information from a number of disparate sources, and using this information to produce a single output. Problems of this type arise in numerous domains. In political science, they are common, occurring whenever voters cast votes which are used to decide 1 the outcome of some issue. Although less directly, they also occur in fields as diverse as control theory and cognitive science. Wherever there is a system which must coalesce information from its subsystems, there is potentially the need to balance conflicting information about a single topic. In any such circumstance, if there is not reason to trust any single source more than the others, the problem can be phrased as one of information aggregation. 2.1.1 Information Aggregation Problems To facilitate the formalization of these problems, we only consider cases in which a finite number of information sources (which shall henceforth be re- ferred to as voters) provide information regarding some contested issue. -
THE SINGLE-MEMBER PLURALITY and MIXED-MEMBER PROPORTIONAL ELECTORAL SYSTEMS : Different Concepts of an Election
THE SINGLE-MEMBER PLURALITY AND MIXED-MEMBER PROPORTIONAL ELECTORAL SYSTEMS : Different Concepts of an Election by James C. Anderson A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Arts in Political Science Waterloo, Ontario, Canada, 2006 © James C. Anderson 2006 Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. Library and Bibliotheque et Archives Canada Archives Canada Published Heritage Direction du Branch Patrimoine de I'edition 395 Wellington Street 395, rue Wellington Ottawa ON K1A 0N4 Ottawa ON K1A 0N4 Canada Canada Your file Votre reference ISBN: 978-0-494-23700-7 Our file Notre reference ISBN: 978-0-494-23700-7 NOTICE: AVIS: The author has granted a non L'auteur a accorde une licence non exclusive exclusive license allowing Library permettant a la Bibliotheque et Archives and Archives Canada to reproduce,Canada de reproduire, publier, archiver, publish, archive, preserve, conserve,sauvegarder, conserver, transmettre au public communicate to the public by par telecommunication ou par I'lnternet, preter, telecommunication or on the Internet,distribuer et vendre des theses partout dans loan, distribute and sell theses le monde, a des fins commerciales ou autres, worldwide, for commercial or non sur support microforme, papier, electronique commercial purposes, in microform,et/ou autres formats. paper, electronic and/or any other formats. The author retains copyright L'auteur conserve la propriete du droit d'auteur ownership and moral rights in et des droits moraux qui protege cette these. this thesis. Neither the thesis Ni la these ni des extraits substantiels de nor substantial extracts from it celle-ci ne doivent etre imprimes ou autrement may be printed or otherwise reproduits sans son autorisation. -
Influences in Voting and Growing Networks
UC Berkeley UC Berkeley Electronic Theses and Dissertations Title Influences in Voting and Growing Networks Permalink https://escholarship.org/uc/item/0fk1x7zx Author Racz, Miklos Zoltan Publication Date 2015 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California Influences in Voting and Growing Networks by Mikl´osZolt´anR´acz A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Statistics in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Elchanan Mossel, Chair Professor James W. Pitman Professor Allan M. Sly Professor David S. Ahn Spring 2015 Influences in Voting and Growing Networks Copyright 2015 by Mikl´osZolt´anR´acz 1 Abstract Influences in Voting and Growing Networks by Mikl´osZolt´anR´acz Doctor of Philosophy in Statistics University of California, Berkeley Professor Elchanan Mossel, Chair This thesis studies problems in applied probability using combinatorial techniques. The first part of the thesis focuses on voting, and studies the average-case behavior of voting systems with respect to manipulation of their outcome by voters. Many results in the field of voting are negative; in particular, Gibbard and Satterthwaite showed that no reasonable voting system can be strategyproof (a.k.a. nonmanipulable). We prove a quantitative version of this result, showing that the probability of manipulation is nonnegligible, unless the voting system is close to being a dictatorship. We also study manipulation by a coalition of voters, and show that the transition from being powerless to having absolute power is smooth. These results suggest that manipulation is easy on average for reasonable voting systems, and thus computational complexity cannot hide manipulations completely. -
Responsiveness, Capture and Efficient Policymaking
CENTRO DE INVESTIGACIÓN Y DOCENCIA ECONÓMICAS, A.C. ELECTIONS AND LOTTERIES: RESPONSIVENESS, CAPTURE AND EFFICIENT POLICYMAKING TESINA QUE PARA OBTENER EL GRADO DE MAESTRO EN CIENCIA POLÍTICA PRESENTA JORGE OLMOS CAMARILLO DIRECTOR DE LA TESINA: DR. CLAUDIO LÓPEZ-GUERRA CIUDAD DE MÉXICO SEPTIEMBRE, 2018 CONTENTS I. Introduction .............................................................................................................. 1 II. Literature Review ..................................................................................................... 6 1. Political Ambition .............................................................................................. 6 2. Electoral Systems and Policymaking ................................................................. 7 3. The Revival of Democracy by Lot ..................................................................... 8 III. Lottocracy in Theory .............................................................................................. 12 IV. Elections and Lotteries ........................................................................................... 14 1. Responsiveness ................................................................................................. 14 2. Legislative Capture ........................................................................................... 16 3. Efficiency.......................................................................................................... 18 V. A Formal Model of Legislator’s Incentives .......................................................... -
Are Condorcet and Minimax Voting Systems the Best?1
1 Are Condorcet and Minimax Voting Systems the Best?1 Richard B. Darlington Cornell University Abstract For decades, the minimax voting system was well known to experts on voting systems, but was not widely considered to be one of the best systems. But in recent years, two important experts, Nicolaus Tideman and Andrew Myers, have both recognized minimax as one of the best systems. I agree with that. This paper presents my own reasons for preferring minimax. The paper explicitly discusses about 20 systems. Comments invited. [email protected] Copyright Richard B. Darlington May be distributed free for non-commercial purposes Keywords Voting system Condorcet Minimax 1. Many thanks to Nicolaus Tideman, Andrew Myers, Sharon Weinberg, Eduardo Marchena, my wife Betsy Darlington, and my daughter Lois Darlington, all of whom contributed many valuable suggestions. 2 Table of Contents 1. Introduction and summary 3 2. The variety of voting systems 4 3. Some electoral criteria violated by minimax’s competitors 6 Monotonicity 7 Strategic voting 7 Completeness 7 Simplicity 8 Ease of voting 8 Resistance to vote-splitting and spoiling 8 Straddling 8 Condorcet consistency (CC) 8 4. Dismissing eight criteria violated by minimax 9 4.1 The absolute loser, Condorcet loser, and preference inversion criteria 9 4.2 Three anti-manipulation criteria 10 4.3 SCC/IIA 11 4.4 Multiple districts 12 5. Simulation studies on voting systems 13 5.1. Why our computer simulations use spatial models of voter behavior 13 5.2 Four computer simulations 15 5.2.1 Features and purposes of the studies 15 5.2.2 Further description of the studies 16 5.2.3 Results and discussion 18 6. -
MGF 1107 FINAL EXAM REVIEW CHAPTER 9 1. Amy (A), Betsy
MGF 1107 FINAL EXAM REVIEW CHAPTER 9 1. Amy (A), Betsy (B), Carla (C), Doris (D), and Emilia (E) are candidates for an open Student Government seat. There are 110 voters with the preference lists below. 36 24 20 18 8 4 A E D B C C B C E D E D C B C C B B D D B E D E E A A A A A Who wins the election if the method used is: a) plurality? b) plurality with runoff? c) sequential pairwise voting with agenda ABEDC? d) Hare system? e) Borda count? 2. What is the minimum number of votes needed for a majority if the number of votes cast is: a) 120? b) 141? 3. Consider the following preference lists: 1 1 1 A C B B A D D B C C D A If sequential pairwise voting and the agenda BACD is used, then D wins the election. Suppose the middle voter changes his mind and reverses his ranking of A and B. If the other two voters have unchanged preferences, B now wins using the same agenda BACD. This example shows that sequential pairwise voting fails to satisfy what desirable property of a voting system? 4. Consider the following preference lists held by 5 voters: 2 2 1 A B C C C B B A A First, note that if the plurality with runoff method is used, B wins. Next, note that C defeats both A and B in head-to-head matchups. This example shows that the plurality with runoff method fails to satisfy which desirable property of a voting system? 5. -
Absolute Voting Rules Adrian Vermeule
University of Chicago Law School Chicago Unbound Coase-Sandor Working Paper Series in Law and Coase-Sandor Institute for Law and Economics Economics 2005 Absolute Voting Rules Adrian Vermeule Follow this and additional works at: https://chicagounbound.uchicago.edu/law_and_economics Part of the Law Commons Recommended Citation Adrian Vermeule, "Absolute Voting Rules" (John M. Olin Program in Law and Economics Working Paper No. 257, 2005). This Working Paper is brought to you for free and open access by the Coase-Sandor Institute for Law and Economics at Chicago Unbound. It has been accepted for inclusion in Coase-Sandor Working Paper Series in Law and Economics by an authorized administrator of Chicago Unbound. For more information, please contact [email protected]. CHICAGO JOHN M. OLIN LAW & ECONOMICS WORKING PAPER NO. 257 (2D SERIES) Absolute Voting Rules Adrian Vermeule THE LAW SCHOOL THE UNIVERSITY OF CHICAGO August 2005 This paper can be downloaded without charge at: The Chicago Working Paper Series Index: http://www.law.uchicago.edu/Lawecon/index.html and at the Social Science Research Network Electronic Paper Collection: http://ssrn.com/abstract_id=791724 Absolute Voting Rules Adrian Vermeule* The theory of voting rules developed in law, political science, and economics typically compares simple majority rule with alternatives, such as various types of supermajority rules1 and submajority rules.2 There is another critical dimension to these questions, however. Consider the following puzzles: $ In the United States Congress, the votes of a majority of those present and voting are necessary to approve a law.3 In the legislatures of California and Minnesota,4 however, the votes of a majority of all elected members are required. -
Free PDF Version
TONY CZARNECKI POSTHUMANS - II Democracy For a Human Federation REFORMING DEMOCRACY FOR HUMANITY’S COEXISTENCE WITH SUPERINTELLIGENCE London, July 2020 Democracy for a Human Federation Reforming Democracy for Humanity’s Coexistence with Superintelligence © Tony Czarnecki 2020 The right of Tony Czarnecki to be identified as the author of this book has been asserted in accordance with the Copyright, Designs and Patents Act 1988. This edition, July 2020 First published in 2019 by Sustensis ISBN: 9781689622332 London, July 2020 For any questions or comments please visit: http://www.sustensis.co.uk 2 For my grandson Leon 3 TABLE OF CONTENTS POSTHUMANS - II ................................................................................................................................ 1 FOREWORD TO POSTHUMANS SERIES ........................................................................................ 7 INTRODUCTION ................................................................................................................................... 8 PART 1 A PERILOUS ROAD TOWARDS A HUMAN FEDERATION ........................................ 11 CHAPTER 1 HUMANITY AT A TURNING POINT ........................................................................ 12 WHAT MAKES US HUMAN? ................................................................................................................. 12 LIVING IN THE WORLD OF EXPONENTIAL CHANGE ............................................................................. 13 IS THIS THE END OF HISTORY? ........................................................................................................... -
On the Distortion of Voting with Multiple Representative Candidates∗
The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18) On the Distortion of Voting with Multiple Representative Candidates∗ Yu Cheng Shaddin Dughmi David Kempe Duke University University of Southern California University of Southern California Abstract voters and the chosen candidate in a suitable metric space (Anshelevich 2016; Anshelevich, Bhardwaj, and Postl 2015; We study positional voting rules when candidates and voters Anshelevich and Postl 2016; Goel, Krishnaswamy, and Mu- are embedded in a common metric space, and cardinal pref- erences are naturally given by distances in the metric space. nagala 2017). The underlying assumption is that the closer In a positional voting rule, each candidate receives a score a candidate is to a voter, the more similar their positions on from each ballot based on the ballot’s rank order; the candi- key questions are. Because proximity implies that the voter date with the highest total score wins the election. The cost would benefit from the candidate’s election, voters will rank of a candidate is his sum of distances to all voters, and the candidates by increasing distance, a model known as single- distortion of an election is the ratio between the cost of the peaked preferences (Black 1948; Downs 1957; Black 1958; elected candidate and the cost of the optimum candidate. We Moulin 1980; Merrill and Grofman 1999; Barbera,` Gul, consider the case when candidates are representative of the and Stacchetti 1993; Richards, Richards, and McKay 1998; population, in the sense that they are drawn i.i.d. from the Barbera` 2001). population of the voters, and analyze the expected distortion Even in the absence of strategic voting, voting systems of positional voting rules. -
Stable Voting
Stable Voting Wesley H. Hollidayy and Eric Pacuitz y University of California, Berkeley ([email protected]) z University of Maryland ([email protected]) September 12, 2021 Abstract In this paper, we propose a new single-winner voting system using ranked ballots: Stable Voting. The motivating principle of Stable Voting is that if a candidate A would win without another candidate B in the election, and A beats B in a head-to-head majority comparison, then A should still win in the election with B included (unless there is another candidate A0 who has the same kind of claim to winning, in which case a tiebreaker may choose between A and A0). We call this principle Stability for Winners (with Tiebreaking). Stable Voting satisfies this principle while also having a remarkable ability to avoid tied outcomes in elections even with small numbers of voters. 1 Introduction Voting reform efforts in the United States have achieved significant recent successes in replacing Plurality Voting with Instant Runoff Voting (IRV) for major political elections, including the 2018 San Francisco Mayoral Election and the 2021 New York City Mayoral Election. It is striking, by contrast, that Condorcet voting methods are not currently used in any political elections.1 Condorcet methods use the same ranked ballots as IRV but replace the counting of first-place votes with head- to-head comparisons of candidates: do more voters prefer candidate A to candidate B or prefer B to A? If there is a candidate A who beats every other candidate in such a head-to-head majority comparison, this so-called Condorcet winner wins the election.