activity
20182025
most citedComputing all Wardrop Equilibria parametrized by the Flow Demand

1 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing 2018Show all

2 papers · 1 filter

cs.GT2018

Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians

Max Klimm, Philipp Warode

We show that computing an equilibrium in atomic splittable congestion games with player-specific affine cost functions is -complet…

cs.GT2018★ 1 cited

Computing all Wardrop Equilibria parametrized by the Flow Demand

Max Klimm, Philipp Warode

We develop an algorithm that computes for a given undirected or directed network with flow-dependent piece-wise linear edge cost functions all Wardrop equilibria as a function of t…