相关论文: Consistent Approval-Based Multi-Winner Rules

We view voting rules as classifiers that assign a winner (a class) to a profile of voters' preferences (an instance). We propose to apply techniques from formal explainability, most notably abductive and contrastive explanations, to…

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…

We study a class of elections in which the input format is trichotomous and allows voters to elicit their negative feelings explicitly. In particular, we study multiwinner elections with a special proclivity to elect proportionally…

In this paper we address the problem of electing a committee among a set of $m$ candidates and on the basis of the preferences of a set of $n$ voters. We consider the approval voting method in which each voter can approve as many candidates…

In many real world situations, collective decisions are made using voting. Moreover, scenarios such as committee or board elections require voting rules that return multiple winners. In multi-winner approval voting (AV), an agent may vote…

This note characterizes every qualified majority voting rule in environments with just two alternatives through anonymity, responsiveness, and q-neutrality. Crucially, the latter imposes independence of the labels of the alternatives if and…

We propose a new single-winner election method ("Schulze method") and prove that it satisfies many academic criteria (e.g. monotonicity, reversal symmetry, resolvability, independence of clones, Condorcet criterion, k-consistency,…

Proportional representation (PR) is one of the central principles in voting. Elegant rules with compelling PR axiomatic properties have the potential to be adopted for several important collective decision making settings. I survey some…

We consider multiwinner elections in Euclidean space using the minimax Chamberlin-Courant rule. In this setting, voters and candidates are embedded in a $d$-dimensional Euclidean space, and the goal is to choose a committee of $k$…

We initiate the work towards a comprehensive picture of the smoothed satisfaction of voting axioms, to provide a finer and more realistic foundation for comparing voting rules. We adopt the smoothed social choice framework, where an…

Participatory budgeting (PB) is a democratic paradigm whereby voters decide on a set of projects to fund with a limited budget. We consider PB in a setting where voters report ordinal preferences over projects and have (possibly) asymmetric…

Predicting the winner of an election is a favorite problem both for news media pundits and computational social choice theorists. Since it is often infeasible to elicit the preferences of all the voters in a typical prediction scenario, a…

We study two notions of stability in multiwinner elections that are based on the Condorcet criterion. The first notion was introduced by Gehrlein: A committee is stable if each committee member is preferred to each non-member by a (possibly…

Several multi-winner systems that use approval voting have been developed but they each suffer from various problems. Six of these methods are discussed in this paper. They are Satisfaction Approval Voting, Minimax Approval Voting,…

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…

We study a model of voting with two alternatives in a symmetric environment. We characterize the interim allocation probabilities that can be implemented by a symmetric voting rule. We show that every such interim allocation probabilities…

Multiwinner voting captures a wide variety of settings, from parliamentary elections in democratic systems to product placement in online shopping platforms. There is a large body of work dealing with axiomatic characterizations,…

We investigate the problem of winner determination from computational social choice theory in the data stream model. Specifically, we consider the task of summarizing an arbitrarily ordered stream of $n$ votes on $m$ candidates into a small…

We propose a secure voting protocol for score-based voting rules, where independent talliers perform the tallying procedure. The protocol outputs the winning candidate(s) while preserving the privacy of the voters and the secrecy of the…

In this paper, we study voting rules on the interval domain, where the alternatives are arranged according to an externally given strict total order and voters report intervals of this order to indicate the alternatives they support. For…