Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fabian Frank

dblp:267/2124 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 61% Computational complexity · 30% Approximation and online algorithms · 9%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › social choice
computational social choice
1.012026
Reconfiguring Proportional Committees · AAAI 2026
Algorithmic game theory and mechanism design › social choice › computational social choice
multiwinner voting
1.012026
Reconfiguring Proportional Committees · AAAI 2026
Computational complexity › complexity classes › PSPACE
PSPACE-completeness
1.012026
Reconfiguring Proportional Committees · AAAI 2026

Methods — techniques the papers use, named apart from their topics

justified representation · 1.0extended justified representation · 1.0
YearPublicationVenuePosition
2026 Reconfiguring Proportional Committees
abstract
An important desideratum in approval-based multiwinner voting is proportionality. We study the problem of reconfiguring proportional committees: given two proportional committees, is there a transition path that consists only of proportional committees, where each transition involves replacing one candidate with another candidate? We show that the set of committees satisfying the proportionality axiom of justified representation (JR) is not always connected, and it is PSPACE-complete to decide whether two such committees are connected. On the other hand, we prove that any two JR committees can be connected by committees satisfying a 2-approximation of JR. We also obtain similar results for the stronger axiom of extended justified representation (EJR). In addition, we demonstrate that the committees produced by several well-known voting rules are connected or at least not isolated, and investigate the reconfiguration problem in restricted preference domains.
Chris Dong 0001, Fabian Frank, Jannik Peters 0001, Warut Suksompong
AAAI2
2025 The Metric Distortion of Randomized Social Choice Functions: C1 Maximal Lottery Rules and Simulations
Fabian Frank, Patrick Lederer
AAMAS1
2021 Using the Metro-Map Metaphor for Drawing Hypergraphs
Fabian Frank, Michael Kaufmann 0001, Stephen G. Kobourov, Tamara Mchedlidze, Sergey Pupyrev, Torsten Ueckerdt, Alexander Wolff 0001
SOFSEM1