English
Related papers

Related papers: Self-Equivalent Voting Rules

200 papers

We propose a stochastic model of opinion exchange in networks. A finite set of agents is organized in a fixed network structure. There is a binary state of the world and each agent receives a private signal on the state. We model beliefs as…

Theoretical Economics · Economics 2022-01-31 Emilien Macault

A fundamental principle of individual rational choice is Sen's $\gamma$ axiom, also known as expansion consistency, stating that any alternative chosen from each of two menus must be chosen from the union of the menus. Expansion consistency…

Theoretical Economics · Economics 2023-03-28 Wesley H. Holliday , Chase Norman , Eric Pacuit , Saam Zahedian

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

The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. Similar impossibility results hold even if we consider a weaker notion of strategy-proofness…

Computer Science and Game Theory · Computer Science 2015-01-08 Samantha Leung , Edward Lui , Rafael Pass

Proportional representation (PR) is a fundamental principle of many democracies world-wide which employ PR-based voting rules to elect their representatives. The normative properties of these voting rules however, are often only understood…

Computer Science and Game Theory · Computer Science 2018-01-30 Barton E. Lee

We study two notions of stability in multiwinner elections that are based on the Condorcet criterion. The first notion was introduced by Gehrlein: A committee is stable if each committee member is preferred to each non-member by a (possibly…

Computer Science and Game Theory · Computer Science 2017-01-30 Haris Aziz , Edith Elkind , Piotr Faliszewski , Martin Lackner , Piotr Skowron

We propose a general framework for strategic voting when a voter may lack knowledge about other votes or about other voters' knowledge about her own vote. In this setting we define notions of manipulation and equilibrium. We also model…

Computer Science and Game Theory · Computer Science 2013-10-28 Hans van Ditmarsch , Jerome Lang , Abdallah Saffidine

Designing private voting rules is an important and pressing problem for trustworthy democracy. In this paper, under the framework of differential privacy, we propose a novel famliy of randomized voting rules based on the well-known…

Computer Science and Game Theory · Computer Science 2024-10-16 Zhechen Li , Ao Liu , Lirong Xia , Yongzhi Cao , Hanpin Wang

In this paper, we study liquid democracy, a collective decision making paradigm which lies between direct and representative democracy. One main feature of liquid democracy is that voters can delegate their votes in a transitive manner so…

Artificial Intelligence · Computer Science 2019-05-17 Bruno Escoffier , Hugo Gilbert , Adèle Pass-Lanneau

Despite many examples to the contrary, most models of elections assume that rules determining the winner will be followed. We present a model where elections are solely a public signal of the incumbent popularity, and citizens can protests…

Physics and Society · Physics 2013-02-04 Andrew T. Little , Joshua A. Tucker , Tom LaGatta

The problem of electing a unique leader is central to all distributed systems, including programmable matter systems where particles have constant size memory. In this paper, we present a silent self-stabilising, deterministic, stationary,…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-12-08 Jérémie Chalopin , Shantanu Das , Maria Kokkou

This paper aims to develop the stability theory for singular stochastic Markov jump systems with state-dependent noise, including both continuous- and discrete-time cases. The sufficient conditions for the existence and uniqueness of a…

Optimization and Control · Mathematics 2015-09-04 Yong Zhao , Weihai Zhang

Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the…

Computer Science and Game Theory · Computer Science 2020-01-07 Aris Filos-Ratsikas , Evi Micha , Alexandros A. Voudouris

The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by…

Computer Science and Game Theory · Computer Science 2022-06-15 Haris Aziz , Alexander Lam

In traditional voter models, opinion dynamics are driven by interactions between individuals, where an individual adopts the opinion of a randomly chosen neighbor. However, these models often fail to capture the emergence of entirely new…

Physics and Society · Physics 2025-10-27 Jeehye Choi , Byungjoon Min , Tobias Galla

Weighted Majority Voting (WMV) is a well-known optimal decision rule for collective decision making, given the probability of sources to provide accurate information (trustworthiness). However, in reality, the trustworthiness is not a known…

Artificial Intelligence · Computer Science 2024-07-02 Shaojie Bai , Dongxia Wang , Tim Muller , Peng Cheng , Jiming Chen

We introduce the threshold $q$-voter opinion dynamics where an agent, facing a binary choice, can change its mind when at least $q_0$ amongst $q$ neighbors share the opposite opinion. Otherwise, the agent can still change its mind with a…

Physics and Society · Physics 2018-07-11 Allan R. Vieira , Celia Anteneodo

Condorcet's paradox is a fundamental result in social choice theory which states that there exist elections in which, no matter which candidate wins, a majority of voters prefer a different candidate. In fact, even if we can select any $k$…

Computer Science and Game Theory · Computer Science 2025-12-02 Moses Charikar , Prasanna Ramakrishnan , Kangning Wang

A key promise of democratic voting is that, by accounting for all constituents' preferences, it produces decisions that benefit the constituency overall. It is alarming, then, that all deterministic voting rules have unbounded distortion:…

Computer Science and Game Theory · Computer Science 2023-05-22 Bailey Flanigan , Ariel D. Procaccia , Sven Wang

We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities. All protocols have polynomial complexity and require…

Cryptography and Security · Computer Science 2008-06-12 Anne Broadbent , Alain Tapp