8 citations · 24 across the 27 of their papers we have counts for
Showing 2023 · cs.GTShow all
3 papers · 2 filters
cs.GT2023
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…
cs.GT2023★ 2 cited
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…
cs.GT2023★ 1 cited
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…