English
Related papers

Related papers: An Experimental Comparison of Multiwinner Voting R…

200 papers

We consider a committee voting setting in which each voter approves of a subset of candidates and based on the approvals, a target number of candidates are to be selected. In particular we focus on the axiomatic property called extended…

Computer Science and Game Theory · Computer Science 2017-03-31 Haris Aziz , Shenwei Huang

Epistemic social choice aims at unveiling a hidden ground truth given votes, which are interpreted as noisy signals about it. We consider here a simple setting where votes consist of approval ballots: each voter approves a set of…

Computer Science and Game Theory · Computer Science 2021-12-09 Tahar Allouche , Jérôme Lang , Florian Yger

When selecting a subset of candidates (a so-called committee) based on the preferences of voters, proportional representation is often a major desideratum. When going beyond simplistic models such as party-list or district-based elections,…

Computer Science and Game Theory · Computer Science 2023-02-07 Markus Brill , Jannik Peters

Electing a single committee of a small size is a classical and well-understood voting situation. Being interested in a sequence of committees, we introduce and study two time-dependent multistage models based on simple Plurality voting.…

Computational Complexity · Computer Science 2024-01-22 Robert Bredereck , Till Fluschnik , Andrzej Kaczmarczyk

In this paper, we study the problem of Participatory Budgeting (PB) with approval ballots, inspired by Multi-Winner Voting schemes. We present generalized preference aggregation methods for participatory budgeting, especially for finding…

Computational Engineering, Finance, and Science · Computer Science 2024-10-10 Rutvik Page , Arnav Doifode , Jitendra Tembhurne , Aishwarya Sagar Anand Ukey

We introduce and study isomorphic distances between ordinal elections (with the same numbers of candidates and voters). The main feature of these distances is that they are invariant to renaming the candidates and voters, and two elections…

Computer Science and Game Theory · Computer Science 2026-01-28 Piotr Faliszewski , Piotr Skowron , Arkadii Slinko , Krzysztof Sornat , Stanisław Szufa , Nimrod Talmon

This paper examines an area of Game Theory called Voting Power Theory. With the adoption of a measure theoretic framework it argues that the many different indices and tools currently used for measuring voting power can be replaced by just…

Statistics Theory · Mathematics 2012-01-24 Sreejith Das , Iead Rezek

This article inspects whether a multivariate distribution is different from a specified distribution or not, and it also tests the equality of two multivariate distributions. In the course of this study, a graphical tool-kit using…

Methodology · Statistics 2024-08-19 Pratim Guha Niyogi , Subhra Sankar Dhar

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

We consider a group of voters that needs to decide between two candidates. We propose a novel family of neutral and strategy-proof rules, which we call sequential unanimity rules. By demonstrating their formal equivalence to the M-winning…

Theoretical Economics · Economics 2024-05-01 Stergios Athanasoglou , Somouaoga Bonkoungou

Classical results in voting theory show that strategic manipulation by voters is inevitable if a voting rule simultaneously satisfy certain desirable properties. Motivated by this, we study the relevant question of how often a voting rule…

Computer Science and Game Theory · Computer Science 2015-02-17 Palash Dey , Y. Narahari

Participatory budgeting is one of the exciting developments in deliberative grassroots democracy. We concentrate on approval elections and propose proportional representation axioms in participatory budgeting, by generalizing relevant…

Computer Science and Game Theory · Computer Science 2017-11-23 Haris Aziz , Barton Lee , Nimrod Talmon

The comparison of alternative rankings of a set of items is a general and prominent task in applied statistics. Predictor variables are ranked according to magnitude of association with an outcome, prediction models rank subjects according…

Several application domains require formal but flexible approaches to the comparison problem. Different process models that cannot be related by behavioral equivalences should be compared via a quantitative notion of similarity, which is…

Logic in Computer Science · Computer Science 2010-06-29 Alessandro Aldini

Formal verification of multi-agent systems is hard, both theoretically and in practice. In particular, studies that use a single verification technique typically show limited efficiency, and allow to verify only toy examples. Here, we…

Many decision problems cannot be solved exactly and use several estimation algorithms that assign scores to the different available options. The estimation errors can have various correlations, from low (e.g. between two very different…

Machine Learning · Computer Science 2023-09-06 Theo Delemazure , François Durand , Fabien Mathieu

Statistical tests that compare classification algorithms are univariate and use a single performance measure, e.g., misclassification error, $F$ measure, AUC, and so on. In multivariate tests, comparison is done using multiple measures…

Machine Learning · Statistics 2014-09-17 Olcay Taner Yildiz , Ethem Alpaydin

Aggregating preferences under incomplete or constrained feedback is a fundamental problem in social choice and related domains. While prior work has established strong impossibility results for pairwise comparisons, this paper extends the…

Computer Science and Game Theory · Computer Science 2025-02-19 Evi Micha , Vasilis Varsamis

We survey the design of elections that are resilient to attempted interference by third parties. For example, suppose votes have been cast in an election between two candidates, and then each vote is randomly changed with a small…

Probability · Mathematics 2021-07-13 Steven Heilman

We study the computational complexity of committee selection problem for several approval-based voting rules in the presence of outliers. Our first result shows that outlier consideration makes committee selection problem intractable for…

Multiagent Systems · Computer Science 2015-11-16 Palash Dey , Neeldhara Misra , Y. Narahari