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

5 papers

cs.GT2025★ 1 cited

Carbon Pricing in Traffic Networks

Svenja M. Griesbach, Tobias Harks, Max Klimm +2

We study how externality pricing can steer traffic toward Wardrop equilibria respecting prescribed budgets. Our multi-commodity model encompasses carbon pricing, cordon pricing, an…

cs.GT2023

Optimizing Throughput and Makespan of Queuing Systems by Information Design

Svenja M. Griesbach, Max Klimm, Philipp Warode +1

We study the optimal provision of information for two natural performance measures of queuing systems: throughput and makespan. A set of parallel links is equipped with determinist…

cs.DS2022

Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs

Per Joachims, Max Klimm, Philipp Warode

This paper studies a variant of the minimum-cost flow problem in a graph with convex cost function where the demands at the vertices are functions depending on a one-dimensional pa…

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…