1 citations · 1 across the 10 of their papers we have counts for
1 paper · 2 filters
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 - Θ(…