1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.GT2012★ 1 cited
Improving the H_k-Bound on the Price of Stability in Undirected Shapley Network Design Games
Yann Disser, Andreas Emil Feldmann, Max Klimm +1
In this paper we show that the price of stability of Shapley network design games on undirected graphs with k players is at most (k^3(k+1)/2-k^2) / (1+k^3(k+1)/2-k^2) H_k = (1 - Θ(…
cs.GT2010
Congestion Games with Variable Demands
Tobias Harks, Max Klimm
We initiate the study of congestion games with variable demands where the (variable) demand has to be assigned to exactly one subset of resources. The players' incentives to use hi…
cs.GT2009
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
Tobias Harks, Max Klimm, Rolf H. Moehring
We introduce a class of finite strategic games with the property that every deviation of a coalition of players that is profitable to each of its members strictly decreases the lex…