From fundamental concepts and results to recent advances in computational social choice,
this open access book provides a thorough and in-depth look at multi-winner voting based …

Traditionally, social choice theory has only been applicable to choices among a few
predetermined alternatives but not to more complex decisions such as collectively selecting …

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 …

The area of computational social choice (COMSOC) analyzes collective decision problems
from an algorithmic perspective. So far, the main focus in this area lied on analyzing …

In the late 19th century, Swedish mathematician Edvard Phragmén proposed a load-
balancing approach for selecting committees based on approval ballots. We consider three …

We study the problem of fair sequential decision making given voter preferences. In each
round, a decision rule must choose a decision from a set of alternatives where each voter …

We consider the problem of fairly allocating indivisible goods to agents with weights
representing their entitlements. A natural rule in this setting is the maximum weighted Nash …

We consider a voting model, where a number of candidates need to be selected subject to
certain feasibility constraints. The model generalizes committee elections (where there is a …

Sortition is a political system in which decisions are made by panels of randomly selected
citizens. The process for selecting a sortition panel is traditionally thought of as uniform …

We study the problem of fairly allocating indivisible items to agents with different
entitlements, which captures, for example, the distribution of ministries among political …