8 citations · 24 across the 27 of their papers we have counts for
36 papers
When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems
Max Klimm, Jannik Matuschke
Consider a finite ground set , a set of feasible solutions , and a class of objective functions defined on . We are interested in su…
Incremental-Decremental Maximization
Yann Disser, Max Klimm, Annette Lutz +1
We introduce a framework for incremental-decremental maximization that captures the gradual transformation or renewal of infrastructures. In our model, an initial solution is trans…
Improved Bounds for Single-Nomination Impartial Selection
Javier Cembrano, Felix Fischer, Max Klimm
We give new bounds for the single-nomination model of impartial selection, a problem proposed by Holzman and Moulin (Econometrica, 2013). A selection mechanism, which may be random…
Incremental Maximization via Continuization
Yann Disser, Max Klimm, Kevin Schewior +1
We consider the problem of finding an incremental solution to a cardinality-constrained maximization problem that not only captures the solution for a fixed cardinality, but also d…
Optimal Impartial Correspondences
Javier Cembrano, Felix Fischer, Max Klimm
We study mechanisms that select a subset of the vertex set of a directed graph in order to maximize the minimum indegree of any selected vertex, subject to an impartiality constrai…
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…