We study approval-based committee elections for the case where the voters' preferences
come from a 2D-Euclidean model. We consider two main issues: First, we ask for the …

We present an almost optimal algorithm for the classic Chamberlin-Courant multiwinner
voting rule (CC) on single-peaked preference profiles. Given $ n $ voters and $ m …

In approval-based multiwinner elections, we are given a set of voters, a set of candidates,
and, for each voter, a set of candidates approved by the voter. The goal is to find a …

We show a prototype of a system that uses multiwinner voting to suggest resources (eg,
movies) related to a given query. For example, a user provides a movie and the system …

In approval-based committee (ABC) elections, the goal is to elect a fixed size subset of the
candidates, a so-called committee, based on the voters' approval ballots over the …

Multiwinner elections have proven to be a fruitful research topic with many real-world
applications. We contribute to this line of research by improving the state of the art regarding …

We study the election of sequences of committees, where in each of $\tau $ levels (eg
modeling points in time) a committee consisting of $ k $ candidates from a common set of …

Object association, ie, the identification of which observations correspond to the same
object, is a central task for the area of multiple object tracking. Two prominent models …

We introduce the model of line-up elections which captures parallel or sequential single-
winner elections with a shared candidate pool. The goal of a line-up election is to find a high …

We study the parameterized complexity of winner determination problems for three prevalent
k-committee selection rules, namely the minimax approval voting (MAV), the proportional …