3 citations · 20 across the 48 of their papers we have counts for
9 papers · 1 filter
Combating Collusion Rings is Hard but Possible
Niclas Boehmer, Robert Bredereck, André Nichterlein
A recent report of Littmann [Commun. ACM '21] outlines the existence and the fatal impact of collusion rings in academic peer reviewing. We introduce and analyze the problem Cycle-…
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets
Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
Following up on purely theoretical work of Bredereck et al. [AAAI 2020], we contribute further theoretical insights into adapting stable two-sided matchings to change. Moreover, we…
Fine-Grained View on Bribery for Group Identification
Niclas Boehmer, Robert Bredereck, Dušan Knop +1
Given a set of agents qualifying or disqualifying each other, group identification is the task of identifying a socially qualified subgroup of agents. Social qualification depends…
Putting a Compass on the Map of Elections
Niclas Boehmer, Robert Bredereck, Piotr Faliszewski +2
Recently, Szufa et al. [AAMAS 2020] presented a "map of elections" that visualizes a set of 800 elections generated from various statistical cultures. While similar elections are g…
Equilibria in Schelling Games: Computational Hardness and Robustness
Luca Kreisel, Niclas Boehmer, Vincent Froese +1
In the simplest game-theoretic formulation of Schelling's model of segregation on graphs, agents of two different types each select their own vertex in a given graph so as to maxim…
Two Influence Maximization Games on Graphs Made Temporal
Niclas Boehmer, Vincent Froese, Julia Henkel +3
To address the dynamic nature of real-world networks, we generalize competitive diffusion games and Voronoi games from static to temporal graphs, where edges may appear or disappea…