English
Related papers

Related papers: Self-Equivalent Voting Rules

200 papers

We consider stability concepts for random matchings where agents have preferences over objects and objects have priorities for the agents. When matchings are deterministic, the standard stability concept also captures the fairness property…

Computer Science and Game Theory · Computer Science 2017-07-06 Haris Aziz , Bettina Klaus

The quantile admission process with veto power is a stochastic processes suggested by Alon, Feldman, Mansour, Oren and Tennenholtz as a model for the evolution of an exclusive social group. The model itself consists of a growing multiset of…

Probability · Mathematics 2018-07-17 Naomi Feldheim , Ohad Noy Feldheim

The stability of a leadership against a growing internal opposition is studied in bottom-up hierarchical organizations. Using a very simple model with bottom-up majority rule voting, the dynamics of power distribution at the various…

Physics and Society · Physics 2007-05-23 Serge Galam

Random dictatorship has been characterized as the only social decision scheme that satisfies efficiency and strategyproofness when individual preferences are strict. We show that no extension of random dictatorship to weak preferences…

Multiagent Systems · Computer Science 2018-04-19 Florian Brandl , Felix Brandt , Warut Suksompong

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

Exclusive social groups are ones in which the group members decide whether or not to admit a candidate to the group. Examples of exclusive social groups include academic departments and fraternal organizations. In the present paper we…

Computer Science and Game Theory · Computer Science 2016-06-01 Noga Alon , Michal Feldman , Yishay Mansour , Sigal Oren , Moshe Tennenholtz

Given the final ranking of a competition, how should the total prize endowment be allocated among the competitors? We study consistent prize allocation rules satisfying elementary solidarity and fairness principles. In particular, we…

Computer Science and Game Theory · Computer Science 2022-09-09 Bas J. Dietzenbacher , Aleksei Y. Kondratev

Many applications, such as content moderation and recommendation, require reviewing and scoring a large number of alternatives. Doing so robustly is however very challenging. Indeed, voters' inputs are inevitably sparse: most alternatives…

Computer Science and Game Theory · Computer Science 2024-01-26 Youssef Allouah , Rachid Guerraoui , Lê-Nguyên Hoang , Oscar Villemaud

In this paper we discuss an empirical phenomena known as the 20-60-20 rule. It says that if we split the population into three groups, according to some arbitrary benchmark criterion, then this particular ratio implies some sort of balance.…

Probability · Mathematics 2015-08-21 Piotr Jaworski , Marcin Pitera

The student-optimal stable mechanism (DA), the most popular mechanism in school choice, is the only one that is stable and strategy-proof. However, when DA is implemented, a student can change the schools of others without changing her own.…

Theoretical Economics · Economics 2026-02-11 Eduardo Duque , Juan S. Pereyra , Juan Pablo Torres-Martínez

Liquid democracy is the principle of making collective decisions by letting agents transitively delegate their votes. Despite its significant appeal, it has become apparent that a weakness of liquid democracy is that a small subset of…

Computer Science and Game Theory · Computer Science 2019-11-20 Paul Gölz , Anson Kahng , Simon Mackenzie , Ariel D. Procaccia

This paper presents mathematics relevant to the question whether voting should be mandatory. Assuming a static distribution of voters' political beliefs, we model how politicians might adjust their positions to raise their share of the…

Physics and Society · Physics 2023-10-24 Christoph Börgers , Natasa Dragovic , Anna Haensch , Arkadz Kirshtein , Lilla Orr

Democracies are built upon secure and reliable voting systems. Electronic voting systems seek to replace ballot papers and boxes with computer hardware and software. Proposed electronic election schemes have been subjected to scrutiny, with…

Cryptography and Security · Computer Science 2026-02-16 Paul Keeler , Ben Smyth

Ranking individuals based on their performance in different coalitions is a problem emerging in various domains (teams sports, scientific evaluation, argumentation, etc.). Often, for practical reasons, the number of comparable coalitions is…

Theoretical Economics · Economics 2026-03-19 Takahiro Suzuki , Michele Aleandri , Stefano Moretti

In social choice settings with linear preferences, random dictatorship is known to be the only social decision scheme satisfying strategyproofness and ex post efficiency. When also allowing indifferences, random serial dictatorship (RSD) is…

Computer Science and Game Theory · Computer Science 2015-02-06 Haris Aziz , Felix Brandt , Markus Brill

Stochastic feedback systems give rise to a variety of notions of stability. The conditions for the stability of the median, mean, and variance stability conditions differ. These conditions can be stated explicitly for scalar discrete-time…

Systems and Control · Electrical Eng. & Systems 2019-12-19 Roy S. Smith , Bassam Bamieh

We design a recursive measure of voting power based on partial as well as full voting efficacy. Classical measures, by contrast, incorporate solely full efficacy. We motivate our design by representing voting games using a division lattice…

Theoretical Economics · Economics 2022-05-25 Arash Abizadeh , Adrian Vetta

Approval-based committee selection is a model of significant interest in social choice theory. In this model, we have a set of voters $\mathcal{V}$, a set of candidates $\mathcal{C}$, and each voter has a set $A_v \subset \mathcal{C}$ of…

Computer Science and Game Theory · Computer Science 2025-08-04 Drew Gao , Yihang Sun , Jan Vondrák

We investigate opinion dynamics in a fully-connected system, consisting of $n$ identical and anonymous agents, where one of the opinions (which is called correct) represents a piece of information to disseminate. In more detail, one source…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-02-20 Luca Becchetti , Andrea Clementi , Amos Korman , Francesco Pasquale , Luca Trevisan , Robin Vacus

We present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require private channels and a simultaneous…

Cryptography and Security · Computer Science 2010-11-25 Anne Broadbent , Stacey Jeffery , Alain Tapp