English
Related papers

Related papers: Axiomatic characterizations of consistent approval…

200 papers

Referring to a standard context of voting theory, and to the classic notion of voting situation, here we show that it is possible to observe any arbitrary set of elections' outcomes, no matter how paradoxical it may appear. On this purpose…

Probability · Mathematics 2022-06-01 Emilio De Santis , Fabio Spizzichino

A well-known axiom for proportional representation is Proportionality of Solid Coalitions (PSC). We characterize committees satisfying PSC as possible outcomes of the Minimal Demand rule, which generalizes an approach pioneered by Michael…

Computer Science and Game Theory · Computer Science 2021-07-15 Haris Aziz , Barton E. Lee

Assume $k$ candidates need to be selected. The candidates appear over time. Each time one appears, it must be immediately selected or rejected -- a decision that is made by a group of individuals through voting. Assume the voters use…

Computer Science and Game Theory · Computer Science 2022-05-09 Virginie Do , Matthieu Hervouin , Jérôme Lang , Piotr Skowron

In this paper, I introduce a novel stability axiom for stochastic voting rules, called self-equivalence, by which a society considering whether to replace its voting rule using itself will choose not to do so. I then show that under the…

Theoretical Economics · Economics 2026-05-14 Héctor Hermida-Rivera

Multi-winner approval voting selects a size-$k$ committee that aggregates voters' approval preferences over a set of alternatives. A central question is coalitional stability: No coalition should be able to pick a committee -- of size at…

Computer Science and Game Theory · Computer Science 2026-05-22 Jiehua Chen , Christian Hatschka

In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…

Logic in Computer Science · Computer Science 2019-06-11 Tianyu Sun , Wensheng Yu

Multi-winner voting rules based on approval ballots have received increased attention in recent years. In particular Satisfaction Approval Voting (SAV) and its variants have been proposed. In this note, we show that the winning set can be…

Computer Science and Game Theory · Computer Science 2015-01-12 Haris Aziz , Toby Walsh

In this paper we develop a novel approach to relaxing Arrow's axioms for voting rules, addressing a long-standing critique in social choice theory. Classical axioms (often styled as fairness axioms or fairness criteria) are assessed in a…

Computer Science and Game Theory · Computer Science 2025-06-17 Suvadip Sana , Daniel Brous , Martin T. Wells , Moon Duchin

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

Proportional representation (PR) is often discussed in voting settings as a major desideratum. For the past century or so, it is common both in practice and in the academic literature to jump to single transferable vote (STV) as the…

Computer Science and Game Theory · Computer Science 2018-06-05 Haris Aziz , Barton Lee

This tutorial deal with the Axiom of Choice and some of its applications to topics related to Computer Science. We will see that the Axiom of Choice is equivalent to some well-known proof principles like Zorn's Lemma or Tuckey's Maximality…

Logic in Computer Science · Computer Science 2014-09-01 Ernst-Erich Doberkat

Explaining decisions of black-box classifiers is both important and computationally challenging. In this paper, we scrutinize explainers that generate feature-based explanations from samples or datasets. We start by presenting a set of…

Artificial Intelligence · Computer Science 2024-08-13 Leila Amgoud , Martin C. Cooper , Salim Debbaoui

The property of proportional representation in approval-based committee elections has appeared in the social choice literature for over a century, and is typically understood as avoiding the underrepresentation of minorities. However, we…

Data Structures and Algorithms · Computer Science 2021-09-14 Alfonso Cevallos , Alistair Stewart

In a recently introduced model of successive committee elections (Bredereck et al., AAAI-20) for a given set of ordinal or approval preferences one aims to find a sequence of a given length of "best" same-size committees such that each…

Computer Science and Game Theory · Computer Science 2025-05-27 Pallavi Jain , Andrzej Kaczmarczyk

We present a novel approach to the core set/instance selection problem in machine learning. Our approach is based on recent results on (proportional) representation in approval-based multi-winner elections. In our model, instances play a…

Machine Learning · Computer Science 2025-12-15 Luis Sánchez-Fernández , Jesús A. Fisteus , Rafael López-Zaragoza

Recent literature highlights the advantages of implementing social rules via dynamic game forms. We characterize when truth-telling remains a dominant strategy in gradual mechanisms implementing strategy-proof social rules, where agents…

Theoretical Economics · Economics 2025-03-27 Wenqian Wang , Zhiwen Zheng

We focus on a generalization of the classic Minisum approval voting rule, introduced by Barrot and Lang (2016), and referred to as Conditional Minisum (CMS), for multi-issue elections with preferential dependencies. Under this rule, voters…

Computer Science and Game Theory · Computer Science 2025-06-10 Evangelos Markakis , Georgios Papasotiropoulos

Voting is the aggregation of individual preferences in order to select a winning alternative. Selection of a winner is accomplished via a voting rule, e.g., rank-order voting, majority rule, plurality rule, approval voting. Which voting…

Theoretical Economics · Economics 2020-05-18 Anne Carlstein

We investigate two systems of fully proportional representation suggested by Chamberlin Courant and Monroe. Both systems assign a representative to each voter so that the "sum of misrepresentations" is minimized. The winner determination…

Computer Science and Game Theory · Computer Science 2014-02-05 Nadja Betzler , Arkadii Slinko , Johannes Uhlmann

We characterize countable dimensionality and strong countable dimensionality by means of an infinite game.

General Topology · Mathematics 2007-09-19 Liljana Babinkostova , Marion Scheepers