21 citations · 71 across the 19 of their papers we have counts for
4 papers · 1 filter
Dynamic Flows with Adaptive Route Choice
Lukas Graf, Tobias Harks, Leon Sering
We study dynamic network flows and introduce a notion of instantaneous dynamic equilibrium (IDE) requiring that for any positive inflow into an edge, this edge must lie on a curren…
Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs
Tobias Harks, Veerle Timmermans
In this paper, we compute -approximate Nash equilibria in atomic splittable polymatroid congestion games with convex Lipschitz continuous cost functions. The main approach relie…
Efficient Black-Box Reductions for Separable Cost Sharing
Tobias Harks, Martin Hoefer, Anja Huber +1
In cost sharing games with delays, a set of agents jointly allocates a finite subset of resources. Each resource has a fixed cost that has to be shared by the players, and each age…
Toll Caps in Privatized Road Networks
Tobias Harks, Marc Schroder, Dries Vermeulen
We consider a network pricing game on a parallel network with congestion effects in which link owners set tolls for travel so as to maximize profit. A central authority is able to…