activity
20142019
most citedComputing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games

11 citations · 33 across the 7 of their papers we have counts for

collaborators

7 papers

cs.GT2019★ 1 cited

From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation

Matthias Feldotto, Pascal Lenzner, Louise Molitor +1

Competing firms tend to select similar locations for their stores. This phenomenon, called the principle of minimum differentiation, was captured by Hotelling with a landmark model…

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.DS2017★ 1 cited

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…

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…

cs.GT2016★ 3 cited

Congestion Games with Mixed Objectives

Matthias Feldotto, Lennart Leder, Alexander Skopalik

We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which…

cs.GT2015★ 5 cited

On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games

Maximilian Drees, Matthias Feldotto, Sören Riechers +1

In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands,…

cs.DC2014★ 10 cited

HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths

Matthias Feldotto, Christian Scheideler, Kalman Graffi

In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph p…