21 citations · 71 across the 19 of their papers we have counts for
3 papers · 1 filter
Routing Games with Progressive Filling
Tobias Harks, Martin Hoefer, Kevin Schewior +1
Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the band…
Robust Quantitative Comparative Statics for a Multimarket Paradox
Tobias Harks, Philipp von Falkenhausen
We introduce a quantitative approach to comparative statics that allows to bound the maximum effect of an exogenous parameter change on a system's equilibrium. The motivation for t…
Complexity and Approximation of the Continuous Network Design Problem
Martin Gairing, Tobias Harks, Max Klimm
We revisit a classical problem in transportation, known as the continuous (bilevel) network design problem, CNDP for short. We are given a graph for which the latency of each edge…