Related papers: Structured Voting for Structured Committees
Citizen-focused democratic processes where participants deliberate on alternatives and then vote to make the final decision are increasingly popular today. While the computational social choice literature has extensively investigated voting…
We consider a voting model, where a number of candidates need to be selected subject to certain feasibility constraints. The model generalises committee elections (where there is a single constraint on the number of candidates that need to…
Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting…
The goal of this paper is twofold. First and foremost, we aim to experimentally and quantitatively show that the choice of a multiwinner voting rule can play a crucial role on the way minorities are represented. We also test the possibility…
In real-world elections where voters cast preference ballots, voters often provide only a partial ranking of the candidates. Despite this empirical reality, prior social choice literature frequently analyzes fairness criteria under the…
Recommender systems are personalized information systems. However, in many settings, the end-user of the recommendations is not the only party whose needs must be represented in recommendation generation. Incorporating this insight gives…
In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that…
We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…
As the world's democratic institutions are challenged by dissatisfied citizens, political scientists and also computer scientists have proposed and analyzed various (innovative) methods to select representative bodies, a crucial task in…
We consider a committee voting on whether to adopt a reform under a quota rule, where members differ in how much they value the reform some supporting it, others opposing it. We examine how members can influence each other's votes through…
We consider the problem of selecting an $n$-member committee made up of one of $m$ candidates from each of $n$ distinct departments. Using an algebraic approach, we analyze positional voting procedures, including the Borda count, as…
Many binary collective choice situations can be described as weighted simple voting games. We introduce weighted committee games to model decisions on an arbitrary number of alternatives in analogous fashion. We compare the effect of…
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…
We investigate binary voting systems with two types of voters and a hierarchy among the members in each type, so that members in one class have more influence or importance than members in the other class. The purpose of this paper is to…
We provide elementary proofs of several results concerning the possible outcomes arising from a fixed profile within the class of positional voting systems. Our arguments enable a simple and explicit construction of paradoxical profiles,…
In the apportionment problem, a fixed number of seats must be distributed among parties in proportion to the number of voters supporting each party. We study a generalization of this setting, in which voters can support multiple parties by…
Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the…
Given a set of agents with approval preferences over each other, we study the task of finding $k$ matchings fairly representing everyone's preferences. We model the problem as an approval-based multiwinner election where the set of…
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 elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…