English
Related papers

Related papers: Sequential unanimity voting rules for binary socia…

200 papers

In this paper, I characterize minimal stable voting rules and minimal self-stable constitutions (i.e., pairs of voting rules) for societies in which only power matters. To do so, I first let players' preference profiles over voting rules…

Theoretical Economics · Economics 2025-08-26 Héctor Hermida-Rivera

We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning…

Computer Science and Game Theory · Computer Science 2017-11-20 Piotr Faliszewski , Arkadii Slinko , Nimrod Talmon

Shortlisting of candidates--selecting a group of "best" candidates--is a special case of multiwinner elections. We provide the first in-depth study of the computational complexity of strategic voting for shortlisting based on the perhaps…

Multiagent Systems · Computer Science 2019-08-15 Robert Bredereck , Andrzej Kaczmarczyk , Rolf Niedermeier

In this paper, we present a link between preference-based and multiobjective sequential decision-making. While transforming a multiobjective problem to a preference-based one is quite natural, the other direction is a bit less obvious. We…

Artificial Intelligence · Computer Science 2017-01-04 Paul Weng

In the theory of voting, the Plurality rule for preferences that come in the form of linear orders selects the alternatives most frequently appearing in the first position of those orders, while the Anti-Plurality rule selects the…

Computer Science and Game Theory · Computer Science 2026-05-21 Ulle Endriss , Federico Fioravanti

In sequential decision making, neural networks (NNs) are nowadays commonly used to represent and learn the agent's policy. This area of application has implied new software quality assessment challenges that traditional validation and…

Software Engineering · Computer Science 2023-12-18 Q. Mazouni , H. Spieker , A. Gotlieb , M. Acher

Sequential dichotomies of general delay equations are not uniform, which was proved two decades ago. This however reminds whether the countably infinite many dichotomies of a neutral equation have the sequential uniformity. In this paper,…

Dynamical Systems · Mathematics 2025-11-21 Shuang Chen , Weinian Zhang

Discovering interpretable patterns for classification of sequential data is of key importance for a variety of fields, ranging from genomics to fraud detection or more generally interpretable decision-making. In this paper, we propose a…

Machine Learning · Computer Science 2023-02-23 Marine Collery , Philippe Bonnard , François Fages , Remy Kusters

We propose a framework for strategic voting when a voter may lack knowledge about the preferences of other voters, or about other voters' knowledge about her own preference. In this setting we define notions of manipulation, equilibrium,…

Computer Science and Game Theory · Computer Science 2021-11-30 Zeinab Bakhtiari , Hans van Ditmarsch , Abdallah Saffidine

Sequential modelling entails making sense of sequential data, which naturally occurs in a wide array of domains. One example is systems that interact with users, log user actions and behaviour, and make recommendations of items of potential…

Information Retrieval · Computer Science 2021-09-15 Christian Hansen

We study the effect of strategic behavior in iterative voting for multiple issues under uncertainty. We introduce a model synthesizing simultaneous multi-issue voting with Meir, Lev, and Rosenschein (2014)'s local dominance theory and…

Computer Science and Game Theory · Computer Science 2023-01-24 Joshua Kavner , Reshef Meir , Francesca Rossi , Lirong Xia

Decision making under uncertainty is a key component of many AI settings, and in particular of voting scenarios where strategic agents are trying to reach a joint decision. The common approach to handle uncertainty is by maximizing expected…

Computer Science and Game Theory · Computer Science 2018-11-15 Omer Lev , Reshef Meir , Svetlana Obraztsova , Maria Polukarov

In the problem of fully allocating a social endowment of perfectly divisible commodities among a group of agents with multidimensional single-peaked preferences, we study strategy-proof rules that are not Pareto-dominated by other…

Theoretical Economics · Economics 2025-02-26 Agustin G. Bonifacio

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

We consider different choice procedures such as scoring rules, rules, using majority relation, value function and tournament matrix, which are used in social and multi-criteria choice problems. We focus on the study of the properties that…

Optimization and Control · Mathematics 2016-11-03 Sergey Shvydun

When we work with information from multiple sources, the formalism each employs to handle uncertainty may not be uniform. In order to be able to combine these knowledge bases of different formats, we need to first establish a common basis…

Artificial Intelligence · Computer Science 2013-02-18 Choh Man Teng

Multiwinner voting rules can be used to select a fixed-size committee from a larger set of candidates. We consider approval-based committee rules, which allow voters to approve or disapprove candidates. In this setting, several voting rules…

Computer Science and Game Theory · Computer Science 2024-11-05 Dominik Peters

Multi-winner voting is the process of selecting a fixed-size set of representative candidates based on voters' preferences. It occurs in applications ranging from politics (parliamentary elections) to the design of modern computer…

Computer Science and Game Theory · Computer Science 2022-11-22 Martin Lackner , Piotr Skowron

Various voting rules are based on ranking the candidates by scores induced by aggregating voter preferences. A winner (respectively, unique winner) is a candidate who receives a score not smaller than (respectively, strictly greater than)…

Computer Science and Game Theory · Computer Science 2021-02-01 Aviram Imber , Benny Kimelfeld

We study the collective schedules problem, which consists in computing a one machine schedule of a set of tasks, knowing that a set of individuals (also called voters) have preferences regarding the order of the execution of the tasks. Our…

Computer Science and Game Theory · Computer Science 2024-03-29 Martin Durand , Fanny Pascual