5 citations · 11 across the 7 of their papers we have counts for
6 papers · 1 filter
Impartial Rank Aggregation
Javier Cembrano, Felix Fischer, Max Klimm
We study functions that produce a ranking of individuals from such rankings and are impartial in the sense that the position of an individual in the output ranking does not…
Information Design for Congestion Games with Unknown Demand
Svenja M. Griesbach, Martin Hoefer, Max Klimm +1
We study a novel approach to information design in the standard traffic model of network congestion games. It captures the natural condition that the demand is unknown to the users…
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…
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…
Sharing Non-Anonymous Costs of Multiple Resources Optimally
Max Klimm, Daniel Schmand
In cost sharing games, the existence and efficiency of pure Nash equilibria fundamentally depends on the method that is used to share the resources' costs. We consider a general cl…
Resource Competition on Integral Polymatroids
Tobias Harks, Max Klimm, Britta Peis
We study competitive resource allocation problems in which players distribute their demands integrally on a set of resources subject to player-specific submodular capacity constrai…