1 code implementation • 24 Feb 2021 • Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner
In the late 19th century, Swedish mathematician Lars Edvard Phragm\'{e}n proposed a load-balancing approach for selecting committees based on approval ballots.
Computer Science and Game Theory
1 code implementation • 4 Dec 2020 • Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong
Tournament solutions are standard tools for identifying winners based on pairwise comparisons between competing alternatives.
Computer Science and Game Theory
no code implementations • 24 Oct 2017 • Markus Brill, Till Fluschnik, Vincent Froese, Brijnesh Jain, Rolf Niedermeier, David Schultz
Dynamic time warping constitutes a major tool for analyzing time series.
no code implementations • 5 Dec 2016 • Piotr Skowron, Martin Lackner, Markus Brill, Dominik Peters, Edith Elkind
In this paper we extend the principle of proportional representation to rankings.
no code implementations • 26 Nov 2016 • Markus Brill, Jean-François Laslier, Piotr Skowron
We establish a link between multiwinner elections and apportionment problems by showing how approval-based multiwinner election rules can be interpreted as methods of apportionment.