
Niclas Boehmer
parameterized algorithmics
cooperative game theory
envy-freeness
social choice theory
stv
axiomatic/computational/experimental analysis
hedonic games
history-dependent utilities
ordinal election
position matrix
condorcet winner
single-peaked elections
group-separable elections
fair allocation
indivisible resources
10
presentations
10
number of views
SHORT BIO
Niclas is a fourth-year PhD student at TU Berlin supervised by Prof. Rolf Niedermeier and Prof. Markus Brill. He works on collective decision-making problems such as voting and stable matching with a focus on (parameterized) computational complexity theory and experimental works. Two recurring themes in his research are incorporating the dynamic nature of reality into collective decision-making problems and enriching the toolbox to conduct meaningful experiments.
Presentations

Properties of Position Matrices and Their Elections
Niclas Boehmer and 6 other authors

Causes of Stability in Dynamic Coalition Formation
Niclas Boehmer and 2 other authors

Rank Aggregation Using Scoring Rules
Niclas Boehmer and 2 other authors

Multivariate Algorithmics for Eliminating Envy by Donating Goods
Junjie Luo and 4 other authors

A Refined Complexity Analysis of Fair Districting over Graphs
Niclas Boehmer

Proportional Representation in Matching Markets: Selecting Multiple Matchings under Dichotomous Preferences
Ulrike Schmidt-Kraepelin and 2 other authors

Equilibria in Schelling Games: Computational Hardness and Robustness
Luca Kreisel and 3 other authors

Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets
Niclas Boehmer and 2 other authors

Combating Collusion Rings is Hard but Possible
Niclas Boehmer and 2 other authors

Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions (Blue Sky Ideas Track)
Niclas Boehmer and 1 other author