English
Related papers

Related papers: Bucklin Voting is Broadly Resistant to Control

200 papers

Schulze voting is a recently introduced voting system enjoying unusual popularity and a high degree of real-world use, with users including the Wikimedia foundation, several branches of the Pirate Party, and MTV. It is a Condorcet voting…

Computer Science and Game Theory · Computer Science 2013-05-27 Curtis Menton , Preetjot Singh

Social influence profoundly impacts individual choices and collective behaviors in politics. In this work, driven by the goal of protecting elections from improper influence, we consider the following scenario: an individual, who has vested…

Social and Information Networks · Computer Science 2025-02-05 Dragos Ristache , Fabian Spaeh , Charalampos E. Tsourakakis

Simplified verifiable re-encryption mix-net (SVRM) is revised and a scheme for e-voting systems is developed based on it. The developed scheme enables e-voting systems to satisfy all essential requirements of elections. Namely, they satisfy…

Cryptography and Security · Computer Science 2015-12-18 Shinsuke Tamura , Hazim A. Haddad , Nazmul Islam , Kazi Md. Rokibul Alam

In traditional access control policies, every access granted and administrative account introduces an additional vulnerability, as a corruption of a high-privilege user can compromise several sensitive files. Privocracy is an access control…

Cryptography and Security · Computer Science 2026-02-03 Pedro Camponês , Hugo Pereira , Adrian Persaud , Kevin Gallagher , Santiago Torres-Arias

Most of the computational study of election problems has assumed that each voter's preferences are, or should be extended to, a total order. However in practice voters may have preferences with ties. We study the complexity of manipulative…

Computer Science and Game Theory · Computer Science 2015-06-16 Zack Fitzsimmons , Edith Hemaspaandra

Coalitional manipulation in voting is considered to be any scenario in which a group of voters decide to misrepresent their vote in order to secure an outcome they all prefer to the first outcome of the election when they vote honestly. The…

Theoretical Economics · Economics 2020-09-28 Mostapha Diss , Boris Tsvelikhovskiy

Nanson's and Baldwin's voting rules select a winner by successively eliminating candidates with low Borda scores. We show that these rules have a number of desirable computational properties. In particular, with unweighted votes, it is…

Artificial Intelligence · Computer Science 2011-06-28 Nina Narodytska , Toby Walsh , Lirong Xia

Over the past few years, the (parameterized) complexity landscape of constructive control for many prevalent approval-based multiwinner voting (ABMV) rules has been explored. We expand these results in two directions. First, we study…

Computer Science and Game Theory · Computer Science 2023-07-04 Yongjie Yang

Proportional representation plays a crucial role in electoral systems. In ordinal elections, where voters rank candidates based on their preferences, the Single Transferable Vote (STV) is the most widely used proportional voting method. STV…

Computer Science and Game Theory · Computer Science 2025-05-02 Tuva Bardal , Markus Brill , David McCune , Jannik Peters

We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…

Computer Science and Game Theory · Computer Science 2019-07-23 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

Social networks are increasingly being used to conduct polls. We introduce a simple model of such social polling. We suppose agents vote sequentially, but the order in which agents choose to vote is not necessarily fixed. We also suppose…

Computer Science and Game Theory · Computer Science 2013-02-08 Serge Gaspers , Victor Naroditskiy , Nina Narodytska , Toby Walsh

We characterise multi-candidate pure-strategy equilibria in the Hotelling-Downs spatial election model for the class of best-worst voting rules, in which each voter is endowed with both a positive and a negative vote, i.e., each voter can…

Computer Science and Game Theory · Computer Science 2016-10-11 Dodge Cahan , Arkadii Slinko

In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but…

Computer Science and Game Theory · Computer Science 2023-12-11 Yannai A. Gonczarowski , Gregory Kehne , Ariel D. Procaccia , Ben Schiffer , Shirley Zhang

Ensuring ballot secrecy is critical for fair and trustworthy electronic voting systems, yet achieving strong secrecy guarantees in decentralized, large-scale elections remains challenging. This paper proposes the concept of collectively…

Most modern control systems are switched, meaning they have continuous as well as discrete decision variables. Switched systems often have constraints called dwell-time constraints (e.g., cycling constraints in a heat pump) on the switching…

Systems and Control · Electrical Eng. & Systems 2020-11-05 Moad Abudia , Michael Harlan , Ryan Self , Rushikesh Kamalapurkar

Voting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., "yes" and "no", every voting system can be described by a (monotone) Boolean function…

Computer Science and Game Theory · Computer Science 2016-07-15 Martin Olsen , Sascha Kurz , Xavier Molinero

In a world where elections touch every aspect of society, the need for secure voting is paramount. Traditional safeguards, based on classical cryptography, rely on complex math problems like factoring large numbers. However, quantum…

Quantum Physics · Physics 2024-07-01 Saiyam Sakhuja , S. Balakrishnan

Scoring systems are an extremely important class of election systems. A length-$m$ (so-called) scoring vector applies only to $m$-candidate elections. To handle general elections, one must use a family of vectors, one per length. The most…

Computer Science and Game Theory · Computer Science 2014-04-18 Edith Hemaspaandra , Lane A. Hemaspaandra , Henning Schnoor

Cumulative and quadratic voting are two distributional voting methods that are expressive, promoting fairness and inclusion, particularly in the realm of participatory budgeting. Despite these benefits, graphical voter interfaces for…

We consider voting rules in settings where voters' identities are difficult to verify. Voters can manipulate the process by casting multiple votes under different identities or abstaining from voting. Immunities to such manipulations are…

Theoretical Economics · Economics 2026-05-15 Agustin G. Bonifacio , Federico Fioravanti