Download or read book Solving Hard Problems in Election Systems written by Andrew Peter Lin and published by . This book was released on 2012 with total page 320 pages. Available in PDF, EPUB and Kindle. Book excerpt: "An interesting problem in the field of computational social choice theory is that of elections, in which a winner or set of winners is to be deduced from preferences among a collection of agents, in a way that attempts to maximize the collective well-being of the agents. Besides their obvious use in political science, elections are also used computationally, such as in multiagent systems, in which different agents may have different beliefs and preferences and must reach an agreeable decision. Because the purpose of voting is to gain an understanding of a collection of actual preference,s dishonesty in an election system is often harmful to the welfare of the voters as a whole. Different forms of dishonesty can be performed by the voters (manipulation), by an outside agent affecting the voters (bribery), or by the chair, or administrator, of an election (Control). The Gibbard-Satterthwaite theorem shows that in all reasonable election systems, manipulation, or strategic voting, is always inevitable in some cases. Bartholdi, Tovey, and Trick counter by arguing that if finding such a manipulation is NP-hard, the manipulation by computationally-limited agents should not pose a significant threat. However, more recent work has exploited the fact that NP-hardness is only a worst-case measure of complexity, and has shown that some election systems that are NP-hard to manipulate may in fact be easy to manipulate under some reasonable assumptions. We evaluate, both theoretically and empirically, the complexity, worst-case and otherwise, of manipulating, bribing, and controlling elections. Our focus is particularly on scoring protocols. In doing so, we gain an understanding of how these election systems work by discovering what makes manipulation, bribery, and control easy or hard. This allows us to discover the strengths and weaknesses of scoring protocols, and gain an understanding of what properties of election systems are desirable or undesirable. One approach we have used to do this is relating the problems of interest in election systems to problems of known complexity, as well as to problems with known algorithms and heuristics, particularly Satisfiability and Partition. This approach can help us gain an understanding of computational social choice problems in which little is known about the complexity or potential algorithms. Among other results, we show how certain parameters and properties of scoring protocols can make elections easy or hard to manipulate. We find that the empirical complexity of manipulation in some cases have unusual behaviors for its complexity class. For example, it is found that in the case of manipulating the Borda election of unweighted voters with an unbounded candidate cardinality, the encoding of this problem to Satisfiability performs especially well near the boundary cases of this problem and for unsatisfiable instances, both results contrary to the normal behavior of NP-complete problems. Although attempts have been made to design fair election systems with certain properties, another dilemma that this has given rise to is the existence of election systems in which it is hard to elect the winners, at least in the worst case. Two notable election systems in which determining the winners are hard are Dodgson and Young. We evaluate the problem of finding the winers empirically, to extend these complexity results away from the worst case, and determine whether the worst-case complexity of these hard winner problems is truly a computational barrier. We find that, like most NP-complete problems such as satisfiability, many instances of interest in finding winners of hard election systems are still relatively simple. We confirm that indeed, like Satisfiability, the hard worst-case results occur only in rare circumstances. We also find an interesting complexity disparity between the related problems of finding the Dodgson or Young score of a candidate, and that of finding the set of Dodgson or Young winners. Surprisingly, it appears empirically easier for one to find the set of all winners in a Dodgson or Young election than to score a single candidate in either election."--Abstract.
Download or read book The Democracy Index written by Heather K. Gerken and published by . This book was released on 2009 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Evaluation and Optimization of Electoral Systems written by Pietro Grilli Di Cortona and published by SIAM. This book was released on 1999-01-01 with total page 246 pages. Available in PDF, EPUB and Kindle. Book excerpt: This monograph offers a systematic quantitative approach to the analysis, evaluation, and design of electoral systems. Today, electoral reform is of concern to newborn democracies as well as many old ones. The authors use mathematical models and automatic procedures, when possible, to solve some of the problems that arise in the comparison of existing systems as well as in the construction of new ones. One distinctive feature of the book is the emphasis on single- and multiple-criteria optimization methods. This powerful tool kit will help political researchers evaluate and choose an appropriate electoral system.
Download or read book Securing the Vote written by National Academies of Sciences, Engineering, and Medicine and published by National Academies Press. This book was released on 2018-09-30 with total page 181 pages. Available in PDF, EPUB and Kindle. Book excerpt: During the 2016 presidential election, America's election infrastructure was targeted by actors sponsored by the Russian government. Securing the Vote: Protecting American Democracy examines the challenges arising out of the 2016 federal election, assesses current technology and standards for voting, and recommends steps that the federal government, state and local governments, election administrators, and vendors of voting technology should take to improve the security of election infrastructure. In doing so, the report provides a vision of voting that is more secure, accessible, reliable, and verifiable.
Download or read book ECAI 2016 written by G.A. Kaminka and published by IOS Press. This book was released on 2016-08-24 with total page 1860 pages. Available in PDF, EPUB and Kindle. Book excerpt: Artificial Intelligence continues to be one of the most exciting and fast-developing fields of computer science. This book presents the 177 long papers and 123 short papers accepted for ECAI 2016, the latest edition of the biennial European Conference on Artificial Intelligence, Europe’s premier venue for presenting scientific results in AI. The conference was held in The Hague, the Netherlands, from August 29 to September 2, 2016. ECAI 2016 also incorporated the conference on Prestigious Applications of Intelligent Systems (PAIS) 2016, and the Starting AI Researcher Symposium (STAIRS). The papers from PAIS are included in this volume; the papers from STAIRS are published in a separate volume in the Frontiers in Artificial Intelligence and Applications (FAIA) series. Organized by the European Association for Artificial Intelligence (EurAI) and the Benelux Association for Artificial Intelligence (BNVKI), the ECAI conference provides an opportunity for researchers to present and hear about the very best research in contemporary AI. This proceedings will be of interest to all those seeking an overview of the very latest innovations and developments in this field.
Download or read book ECAI 2023 written by K. Gal and published by IOS Press. This book was released on 2023-10-18 with total page 3328 pages. Available in PDF, EPUB and Kindle. Book excerpt: Artificial intelligence, or AI, now affects the day-to-day life of almost everyone on the planet, and continues to be a perennial hot topic in the news. This book presents the proceedings of ECAI 2023, the 26th European Conference on Artificial Intelligence, and of PAIS 2023, the 12th Conference on Prestigious Applications of Intelligent Systems, held from 30 September to 4 October 2023 and on 3 October 2023 respectively in Kraków, Poland. Since 1974, ECAI has been the premier venue for presenting AI research in Europe, and this annual conference has become the place for researchers and practitioners of AI to discuss the latest trends and challenges in all subfields of AI, and to demonstrate innovative applications and uses of advanced AI technology. ECAI 2023 received 1896 submissions – a record number – of which 1691 were retained for review, ultimately resulting in an acceptance rate of 23%. The 390 papers included here, cover topics including machine learning, natural language processing, multi agent systems, and vision and knowledge representation and reasoning. PAIS 2023 received 17 submissions, of which 10 were accepted after a rigorous review process. Those 10 papers cover topics ranging from fostering better working environments, behavior modeling and citizen science to large language models and neuro-symbolic applications, and are also included here. Presenting a comprehensive overview of current research and developments in AI, the book will be of interest to all those working in the field.
Download or read book Making Votes Count written by Gary W. Cox and published by Cambridge University Press. This book was released on 1997-03-28 with total page 362 pages. Available in PDF, EPUB and Kindle. Book excerpt: Popular elections are at the heart of representative democracy. Thus, understanding the laws and practices that govern such elections is essential to understanding modern democracy. In this book, Cox views electoral laws as posing a variety of coordination problems that political forces must solve. Coordination problems - and with them the necessity of negotiating withdrawals, strategic voting, and other species of strategic coordination - arise in all electoral systems. This book employs a unified game-theoretic model to study strategic coordination worldwide and that relies primarily on constituency-level rather than national aggregate data in testing theoretical propositions about the effects of electoral laws. This book also considers not just what happens when political forces succeed in solving the coordination problems inherent in the electoral system they face but also what happens when they fail.
Download or read book Economics and Computation written by Jörg Rothe and published by Springer Nature. This book was released on 2024 with total page 779 pages. Available in PDF, EPUB and Kindle. Book excerpt: This textbook connects three vibrant areas at the interface between economics and computer science: algorithmic game theory, computational social choice, and fair division. It thus offers an interdisciplinary treatment of collective decision making from an economic and computational perspective. Part I introduces to algorithmic game theory, focusing on both noncooperative and cooperative game theory. Part II introduces to computational social choice, focusing on both preference aggregation (voting) and judgment aggregation. Part III introduces to fair division, focusing on the division of both a single divisible resource ("cake-cutting") and multiple indivisible and unshareable resources ("multiagent resource allocation"). In all these parts, much weight is given to the algorithmic and complexity-theoretic aspects of problems arising in these areas, and the interconnections between the three parts are of central interest.
Download or read book Fundamentals of Computation Theory written by Evripidis Bampis and published by Springer Nature. This book was released on 2021-09-11 with total page 476 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 23rd International Symposium on Fundamentals of Computation Theory, FCT 2021, held in Athens, Greece, in September 2021. The 30 full papers included in this volume were carefully reviewed and selected from 94 submissions. In addition, the book contains 2 invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.
Download or read book The Mathematics of Voting and Elections A Hands On Approach written by Jonathan K. Hodge and published by American Mathematical Soc.. This book was released on 2018-10-01 with total page 238 pages. Available in PDF, EPUB and Kindle. Book excerpt: The Mathematics of Voting and Elections: A Hands-On Approach, Second Edition, is an inquiry-based approach to the mathematics of politics and social choice. The aim of the book is to give readers who might not normally choose to engage with mathematics recreationally the chance to discover some interesting mathematical ideas from within a familiar context, and to see the applicability of mathematics to real-world situations. Through this process, readers should improve their critical thinking and problem solving skills, as well as broaden their views of what mathematics really is and how it can be used in unexpected ways. The book was written specifically for non-mathematical audiences and requires virtually no mathematical prerequisites beyond basic arithmetic. At the same time, the questions included are designed to challenge both mathematical and non-mathematical audiences alike. More than giving the right answers, this book asks the right questions. The book is fun to read, with examples that are not just thought-provoking, but also entertaining. It is written in a style that is casual without being condescending. But the discovery-based approach of the book also forces readers to play an active role in their learning, which should lead to a sense of ownership of the main ideas in the book. And while the book provides answers to some of the important questions in the field of mathematical voting theory, it also leads readers to discover new questions and ways to approach them. In addition to making small improvements in all the chapters, this second edition contains several new chapters. Of particular interest might be Chapter 12 which covers a host of topics related to gerrymandering.
Download or read book ECAI 2020 written by G. De Giacomo and published by IOS Press. This book was released on 2020-09-11 with total page 3122 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents the proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), held in Santiago de Compostela, Spain, from 29 August to 8 September 2020. The conference was postponed from June, and much of it conducted online due to the COVID-19 restrictions. The conference is one of the principal occasions for researchers and practitioners of AI to meet and discuss the latest trends and challenges in all fields of AI and to demonstrate innovative applications and uses of advanced AI technology. The book also includes the proceedings of the 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020) held at the same time. A record number of more than 1,700 submissions was received for ECAI 2020, of which 1,443 were reviewed. Of these, 361 full-papers and 36 highlight papers were accepted (an acceptance rate of 25% for full-papers and 45% for highlight papers). The book is divided into three sections: ECAI full papers; ECAI highlight papers; and PAIS papers. The topics of these papers cover all aspects of AI, including Agent-based and Multi-agent Systems; Computational Intelligence; Constraints and Satisfiability; Games and Virtual Environments; Heuristic Search; Human Aspects in AI; Information Retrieval and Filtering; Knowledge Representation and Reasoning; Machine Learning; Multidisciplinary Topics and Applications; Natural Language Processing; Planning and Scheduling; Robotics; Safe, Explainable, and Trustworthy AI; Semantic Technologies; Uncertainty in AI; and Vision. The book will be of interest to all those whose work involves the use of AI technology.
Download or read book Handbook of Computational Social Choice written by Felix Brandt and published by Cambridge University Press. This book was released on 2016-04-25 with total page 553 pages. Available in PDF, EPUB and Kindle. Book excerpt: A comprehensive survey of computational aspects of collective decisions for graduate students, researchers, and professionals in computer science and economics.
Download or read book Race Reform and Regulation of the Electoral Process written by Guy-Uriel E. Charles and published by Cambridge University Press. This book was released on 2011-01-17 with total page 313 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book offers a critical re-evaluation of three fundamental and interlocking themes in American democracy: the relationship between race and politics, the performance and reform of election systems and the role of courts in regulating the political process. This edited volume features contributions from some of the leading voices in election law and social science. The authors address the recurring questions for American democracy and identify new challenges for the twenty-first century. They not only consider where current policy and scholarship are headed, but also suggest where they ought to go over the next two decades. The book thus provides intellectual guideposts for future scholarship and policy making in American democracy.
Download or read book Computer Science Theory and Applications written by Henning Fernau and published by Springer Nature. This book was released on 2020-06-22 with total page 444 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data. The conference was cancelled as a live conference due to the corona pandemic.
Download or read book Handbook on Approval Voting written by Jean-François Laslier and published by Springer Science & Business Media. This book was released on 2010-06-25 with total page 482 pages. Available in PDF, EPUB and Kindle. Book excerpt: With approval voting, voters can approve of as many candidates as they want, and the one approved by the most voters wins. This book surveys a wide variety of empirical and theoretical knowledge accumulated from years of studying this method of voting.
Download or read book Chaotic Elections written by Donald Saari and published by American Mathematical Soc.. This book was released on 2001-04-03 with total page 178 pages. Available in PDF, EPUB and Kindle. Book excerpt: What does the 2000 U.S. presidential election have in common with selecting a textbook for a calculus course in your department? Was Ralph Nader's influence on the election of George W. Bush greater than the now-famous chads? In Chaotic Elections!, Don Saari analyzes these questions, placing them in the larger context of voting systems in general. His analysis shows that the fundamental problems with the 2000 presidential election are not with the courts, recounts, or defective ballots, but are caused by the very way Americans vote for president. This expository book shows how mathematics can help to identify and characterize a disturbingly large number of paradoxical situations that result from the choice of a voting procedure. Moreover, rather than being able to dismiss them as anomalies, the likelihood of a dubious election result is surprisingly large. These consequences indicate that election outcomes--whether for president, the site of the next Olympics, the chair of a university department, or a prize winner--can differ from what the voters really wanted. They show that by using an inadequate voting procedure, we can, inadvertently, choose badly. To add to the difficulties, it turns out that the mathematical structures of voting admit several strategic opportunities, which are described. Finally, mathematics also helps identify positive results: By using mathematical symmetries, we can identify what the phrase ``what the voters really want'' might mean and obtain a unique voting method that satisfies these conditions. Saari's book should be required reading for anyone who wants to understand not only what happened in the presidential election of 2000, but also how we can avoid similar problems from appearing anytime any group is making a choice using a voting procedure. Reading this book requires little more than high school mathematics and an interest in how the apparently simple situation of voting can lead to surprising paradoxes.
Download or read book Voting Technology written by Paul S. Herrnson and published by Rowman & Littlefield. This book was released on 2009-03-19 with total page 234 pages. Available in PDF, EPUB and Kindle. Book excerpt: Voting difficulties hung over America's presidential election in 2000 like a dark cloud. Hanging chads, a butterfly ballot, and the Supreme Court remain the most vivid memories of that political donnybrook. Passage of 2002's Help America Vote Act sparked further interest in the physical process of casting a ballot, yet several recent contests still produced confusion at the polls. A solution to at least some of those problems may be found in new technology, but such innovations carry their own concerns and questions. V oting Technology is the first book to investigate in a scientific and authoritative manner how voters respond to the new equipment. The authors—an interdisciplinary group of experts in American elections, political behavior, human-computer interaction, and human factors psychology—assess five commercially available voting systems, each one representing a specific class based on shared design principles, as well as a prototype system not currently available. They evaluate the systems against different criteria (including ease of use, speed, and accuracy) using field experiments, laboratory experiments, and expert reviews. The results reveal the good and bad about the new systems, including specific features that contribute to clarity, confusion, or error. Going beyond the concern with spoiled ballots, they determine whether voters actually cast their ballots for the candidates they intended to support. They address fundamental questions of whether voters like and trust the equipment and whether the various systems are equally usable by all voters. Their research also opens up an entirely new line of inquiry by asking about the interaction between ballot format and voter behavior. The concluding chapter pulls together best practices that will guide manufacturers of voting systems, ballot designers, election officials, political observers, and of course, voters. In a political system based on free exercise of personal choice, the least w
