11 citations · 35 across the 23 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.GT2017★ 11 cited
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games
Matthias Feldotto, Martin Gairing, Grammateia Kotsialou +1
We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion…
cs.GT2017★ 2 cited
Congestion Games with Complementarities
Matthias Feldotto, Lennart Leder, Alexander Skopalik
We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in modern networked environments. Our model is inspired by util…