English
Related papers

Related papers: Apportionment with Weighted Seats

200 papers

Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms…

Data Structures and Algorithms · Computer Science 2017-12-06 Raphael Reitzig , Sebastian Wild

We consider item allocation to individual agents who have additive valuations, in settings in which there are protected groups, and the allocation needs to give each protected group its "fair" share of the total welfare. Informally, within…

Computer Science and Game Theory · Computer Science 2022-04-15 Uriel Feige , Yehonatan Tahan

We consider three algorithms for allocating parliamentary seats by proportional representation. The usual approach to describing such algorithms is to compute a quota of votes that each party uses to "acquire'' representatives. This kind of…

Data Structures and Algorithms · Computer Science 2023-11-07 Raul Rojas

This paper studies the allocation of voting weights in a committee representing groups of different sizes. We introduce a partial ordering of weight allocations based on stochastic comparison of social welfare. We show that when the number…

Theoretical Economics · Economics 2024-03-07 Kazuya Kikuchi

While proportionality is frequently named as a desirable property of voting rules, its interpretation in multiwinner voting differs significantly from that in apportionment. We aim to bridge these two distinct notions of proportionality by…

Computer Science and Game Theory · Computer Science 2026-02-11 Daria Boratyn , Dariusz Stolicki

We study the fair allocation of indivisible items under relevance constraints, where each agent has a set of relevant items and can only receive items that are relevant to them. While the relevance constraint has been studied in recent…

Computer Science and Game Theory · Computer Science 2026-03-19 Ankang Sun , Ruijie Wang , Bo Li

Envy-Freeness is one of the most fundamental and important concepts in fair allocation. Some recent studies have focused on the concept of weighted envy-freeness. Under this concept, each agent is assigned a weight, and their valuations are…

Computer Science and Game Theory · Computer Science 2025-05-09 Yuxi Liu , Mingyu Xiao

The definition of preferences assigned to individuals is a concept that concerns many disciplines, from economics, with the search of an acceptable outcome for an ensemble of individuals, to decision making an analysis of vote systems. We…

Physics and Society · Physics 2008-12-02 Elena Ramirez Barrios , Juan G. Diaz Ochoa

Determining the power distribution of the members of a shareholder meeting or a legislative committee is a well-known problem for many applications. In some cases it turns out that power is nearly proportional to relative voting weights,…

Computer Science and Game Theory · Computer Science 2018-08-09 Sascha Kurz

We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the same group share the same set of goods even though they may have different preferences. Previous work has focused on unanimous fairness, in which…

Computer Science and Game Theory · Computer Science 2020-01-01 Erel Segal-Halevi , Warut Suksompong

We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stochastic dominance relation between fractional or randomized…

Computer Science and Game Theory · Computer Science 2015-06-18 Haris Aziz , Serge Gaspers , Simon Mackenzie , Toby Walsh

Sortition is the practice of delegating public decision-making to randomly selected panels. Recently, it has gained momentum worldwide through its use in citizens' assemblies, sparking growing interest within the computer science community.…

Computer Science and Game Theory · Computer Science 2025-05-20 Johannes Brustle , Simone Fioravanti , Tomasz Ponitka , Jeremy Vollen

Randomisation and time-sharing are some of the oldest methods to achieve fairness. I make a case that applying these approaches to social choice settings constitutes a powerful paradigm that deserves an extensive and thorough examination. I…

Computer Science and Game Theory · Computer Science 2020-02-25 Haris Aziz

Many policies allocate harms or benefits that are uncertain in nature: they produce distributions over the population in which individuals have different probabilities of incurring harm or benefit. Comparing different policies thus involves…

Computers and Society · Computer Science 2021-03-11 Hoda Heidari , Solon Barocas , Jon Kleinberg , Karen Levy

We consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with diversity constraints,…

Computer Science and Game Theory · Computer Science 2026-02-10 Piotr Skowron

Motivated by the common academic problem of allocating papers to referees for conference reviewing we propose a novel mechanism for solving the assignment problem when we have a two sided matching problem with preferences from one side (the…

Artificial Intelligence · Computer Science 2017-05-22 Jing Wu Lian , Nicholas Mattei , Renee Noble , Toby Walsh

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…

Computer Science and Game Theory · Computer Science 2016-12-06 Piotr Skowron , Martin Lackner , Markus Brill , Dominik Peters , Edith Elkind

We introduce a family of normative principles to assess fairness in the context of participatory budgeting. These principles are based on the fundamental idea that budget allocations should be fair in terms of the resources invested into…

Computer Science and Game Theory · Computer Science 2023-02-21 Jan Maly , Simon Rey , Ulle Endriss , Martin Lackner

A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If we consider the objects as indivisible, many instances of the decision problem: ``Is there a fair division of the objects…

Computer Science and Game Theory · Computer Science 2025-07-03 Samuel Bismuth , Ivan Bliznets , Erel Segal-Halevi

We study the problem of fairly allocating indivisible items to agents with different entitlements, which captures, for example, the distribution of ministries among political parties in a coalition government. Our focus is on picking…

Computer Science and Game Theory · Computer Science 2021-08-24 Mithun Chakraborty , Ulrike Schmidt-Kraepelin , Warut Suksompong