1 citations · 1 across the 4 of their papers we have counts for
4 papers
Blindfolded pursuit with delays of your choice
Torben Schürenberg, Maximilian J. Stahlberg
We study pursuit-evasion games on graphs with a single pursuer and an invisible evader. The pursuer may assign integer travel times to the edges of the graph and specify a finite s…
Deterministic Impartial Selection with Weights
Javier Cembrano, Svenja M. Griesbach, Maximilian J. Stahlberg
In the impartial selection problem, a subset of agents up to a fixed size among a group of is to be chosen based on votes cast by the agents themselves. A selection mechani…
Complexity of equilibria in binary public goods games on undirected graphs
Max Klimm, Maximilian J. Stahlberg
We study the complexity of computing equilibria in binary public goods games on undirected graphs. In such a game, players correspond to vertices in a graph and face a binary choic…
A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
Cristina Bazgan, Till Fluschnik, André Nichterlein +2
We study the NP-hard Shortest Path Most Vital Edges problem arising in the context of analyzing network robustness. For an undirected graph with positive integer edge lengths and t…