6 papers · 1 filter
Beyond Lower Quota: Avoiding Overrepresentation in Multi-Winner Voting
Anton Baychkov, Martin Lackner, Jan Maly +2
Recently, in the social choice literature, much attention has been given to the question of avoiding underrepresentation in approval-based multi-winner voting. In this paper, we ex…
Computational Social Choice: Research & Development
Dorothea Baumeister, Ratip Emin Berker, Niclas Boehmer +7
Computational social choice (COMSOC) studies principled ways to aggregate conflicting individual preferences into collective decisions. In this paper, we call for an increased effo…
Proportional Justified Representation
Luis Sánchez-Fernández, Edith Elkind, Martin Lackner +4
The goal of multi-winner elections is to choose a fixed-size committee based on voters' preferences. An important concern in this setting is representation: large groups of voters…
Free-Riding in Multi-Issue Decisions
Martin Lackner, Jan Maly, Oliviero Nardi
Voting in multi-issue domains allows for compromise outcomes that satisfy all voters to some extent, but such fairness considerations open the possibility of a special form of mani…
Computing the Schulze Method for Large-Scale Preference Data Sets
Theresa Csar, Martin Lackner, Reinhard Pichler
The Schulze method is a voting rule widely used in practice and enjoys many positive axiomatic properties. While it is computable in polynomial time, its straight-forward implement…
Preference Restrictions in Computational Social Choice: A Survey
Edith Elkind, Martin Lackner, Dominik Peters
Social choice becomes easier on restricted preference domains such as single-peaked, single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the structur…