English
Related papers

Related papers: An Axiomatic Characterization of Split Cycle

200 papers

There is a common belief that humans and many animals follow transitive inference (choosing A over C on the basis of knowing that A is better than B and B is better than C). Transitivity seems to be the essence of rational choice. We…

Computer Science and Game Theory · Computer Science 2014-09-23 Marcin Makowski , Edward W. Piotrowski

Pairwise comparisons are a well-known method for the representation of the subjective preferences of a decision maker. Evaluating their inconsistency has been a widely studied and discussed topic and several indices have been proposed in…

Artificial Intelligence · Computer Science 2014-12-25 Matteo Brunelli , Michele Fedrizzi

We study the {PAC} learnability of multiwinner voting, focusing on the class of approval-based committee scoring (ABCS) rules. These are voting rules applied on profiles with approval ballots, where each voter approves some of the…

Computer Science and Game Theory · Computer Science 2023-08-02 Ioannis Caragiannis , Karl Fehrs

The main idea of the {\em distance rationalizability} approach to view the voters' preferences as an imperfect approximation to some kind of consensus is deeply rooted in social choice literature. It allows one to define ("rationalize")…

Computer Science and Game Theory · Computer Science 2010-09-03 Edith Elkind , Piotr Faliszewski , Arkadii Slinko

This paper introduces a novel binary stability property for voting rules-called binary self-selectivity-by which a society considering whether to replace its voting rule using itself in pairwise elections will choose not to do so. In…

Theoretical Economics · Economics 2025-08-27 Héctor Hermida-Rivera , Toygar T. Kerman

Multi-winner approval elections are seen in a variety of settings ranging from academic societies and associations to public elections. In such elections, it is often the case that ballot-length restrictions are enforced; that is, where…

Computer Science and Game Theory · Computer Science 2017-11-15 Barton E. Lee

Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion.…

Data Structures and Algorithms · Computer Science 2016-11-02 Colin Cooper , Robert Elsässer , Tomasz Radzik

AI alignment and participatory design motivate a new democratic design problem: how to collectively choose a decision rule to use repeatedly. We study this problem for linear ranking rules, which repeatedly rank items $x_j$ within batches…

Computer Science and Game Theory · Computer Science 2026-05-14 Carmel Baharav , Niclas Boehmer , Bailey Flanigan , Maximilian T. Wittmann

Lu and Boutilier proposed a novel approach based on "minimax regret" to use classical score based voting rules in the setting where preferences can be any partial (instead of complete) orders over the set of alternatives. We show here that…

Multiagent Systems · Computer Science 2017-11-13 Palash Dey

There is a striking relationship between a three hundred years old Political Science theorem named "Condorcet's jury theorem" (1785), which states that majorities are more likely to choose correctly when individual votes are often correct…

Machine Learning · Computer Science 2020-02-17 Hanan Shteingart , Eran Marom , Igor Itkin , Gil Shabat , Michael Kolomenkin , Moshe Salhov , Liran Katzir

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show…

Computer Science and Game Theory · Computer Science 2014-07-14 Haris Aziz , Serge Gaspers , Joachim Gudmundsson , Simon Mackenzie , Nicholas Mattei , Toby Walsh

We study the election control problem with multi-votes, where each voter can present a single vote according different views (or layers, we use "layer" to represent "view"). For example, according to the attributes of candidates, such as:…

Computational Complexity · Computer Science 2023-07-03 Fengbo Wang , Aizhong Zhou , Jianliang Xu

We study committee elections from a perspective of finding the most conflicting candidates, that is, candidates that imply the largest amount of conflict, as per voter preferences. By proposing basic axioms to capture this objective, we…

Computer Science and Game Theory · Computer Science 2024-05-10 Théo Delemazure , Łukasz Janeczko , Andrzej Kaczmarczyk , Stanisław Szufa

Collective leadership and herding may arise in standard models of opinion dynamics as an interplay of a strong separation of time scales within the population and its hierarchical organization. Using the voter model as a simple opinion…

Physics and Society · Physics 2017-07-12 Liudmila Rozanova , Marian Boguna

Approval-Based Committee (ABC) rules are an important tool for choosing a fair set of candidates when given the preferences of a collection of voters. Though finding a winning committee for many ABC rules is NP-hard, natural variations for…

Computer Science and Game Theory · Computer Science 2025-08-06 Zack Fitzsimmons , Zohair Raza Hassan , Edith Hemaspaandra

This article starts by introducing a new theoretical framework to model spatial systems which is obtained from the framework of interacting particle systems by replacing the traditional graphical structure that defines the network of…

Probability · Mathematics 2015-06-12 Nicolas Lanchier , Jared Neufer

We study a class of {\em aggregation rules} that could be applied to ethical AI decision-making. These rules yield the decisions to be made by automated systems based on the information of profiles of preferences over possible choices. We…

Theoretical Economics · Economics 2023-06-29 Federico Fioravanti , Iyad Rahwan , Fernando Abel Tohmé

We demonstrate that a potential coexists with limit cycle. Here the potential determines the final distribution of population. Our demonstration consists of three steps: We first show the existence of limit from a typical physical sciences…

Chaotic Dynamics · Physics 2007-05-23 X. -M. Zhu , L. Yin , P. Ao

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve…

Computer Science and Game Theory · Computer Science 2021-05-03 Martin Lackner , Jan Maly

We introduce two models of multiwinner elections with approval preferences and labelled candidates that take the committee's diversity into account. One model aims to find a committee with maximal diversity given a scoring function (e.g. of…

Computer Science and Game Theory · Computer Science 2026-02-13 Paula Böhm , Robert Bredereck , Till Fluschnik