11 citations · 33 across the 7 of their papers we have counts for
3 papers · 1 filter
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…
A Tight Approximation for Fully Dynamic Bin Packing without Bundling
Björn Feldkord, Matthias Feldotto, Sören Riechers
We consider a variant of the classical Bin Packing Problem, called Fully Dynamic Bin Packing. In this variant, items of a size in must be packed in bins of unit size. In ea…
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…