collaborators

16 papers

cs.GT2026

Agreement, Diversity, and Polarization Indices for Approval Elections

Piotr Faliszewski, Jitka Mertlová, Krzysztof Sornat +2

An index is a function that given an election outputs a value between 0 and 1, indicating the extent to which this election has a particular feature. We seek indices that capture a…

cs.GT2026

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…

cs.GT2026

Outer Diversity of Structured Domains

Piotr Faliszewski, Krzysztof Sornat, Stanisław Szufa +1

An ordinal preference domain is a subset of preference orders that the voters are allowed to cast in an election. We introduce and study the notion of outer diversity of a domain a…

cs.GT2026

How Similar Are Two Elections?

Piotr Faliszewski, Piotr Skowron, Arkadii Slinko +3

We introduce and study isomorphic distances between ordinal elections (with the same numbers of candidates and voters). The main feature of these distances is that they are invaria…

cs.GT2026

Robustness of Approval-Based Multiwinner Voting Rules

Piotr Faliszewski, Grzegorz Gawron, Bartosz Kusek

We investigate how robust approval-based multiwinner voting rules are to small perturbations in the votes. In particular, we consider the extent to which a committee can change aft…

cs.GT2026

Learning Real-Life Approval Elections

Piotr Faliszewski, Łukasz Janeczko, Andrzej Kaczmarczyk +3

We study the independent approval model (IAM) for approval elections, where each candidate has its own approval probability and is approved independently of the other ones. This mo…