Add to ORKG1 Introduction We consider routing problems in the Wardrop model. We are given a networkequipped with non-decreasing latency functions mapping flow on the edges to latency. For each of several commodities a fixed flow rate has to be routed from asource to a sink via a collection of paths. A flow vector is said to be at Wardrop equilibrium if for all commodities the latencies of all used paths are minimalwith respect to this commodity. Whereas such equilibria can be formulated as? Supported by DFG grant Vo889/1-3 and by DFG through German excellence cluste
A simple dynamics capturing user behavior in a network is shown to lead to equilibria that can be vi...
The analysis of network routing games typically assumes, right at the onset, precise and detailed in...
This thesis deals with dynamic, load-adaptive rerouting policies in game theoretic settings. In the ...
Global communication networks like the Internet often lack a central authority that monitors and reg...
This article presents a multicommodity, discrete-time, distributed, and noncooperative routing algor...
In recent years there has been a growing interest in mathematical models for routing in networks in ...
iv This thesis deals with dynamic, load-adaptive rerouting policies in game theoretic settings. In t...
According to Wardrop's first principle, agents in a congested network choose their routes selfishly,...
There has been substantial work developing simple, efficient no-regret algorithms for a wide class o...
We study the question of whether a large population of agents in a traffic network is able to conver...
There has been substantial work developing simple, efficient no-regret algorithms for a wide class o...
Abstract. Network games can be used to model competitive situations in which agents select routes to...
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic ...
The goal of this paper is to find Wardrop equilibrium in transport networks at case of uncertainty s...
Abstract. Wardrop equilibria are commonly used as a solution concept of network games when modeling ...
A simple dynamics capturing user behavior in a network is shown to lead to equilibria that can be vi...
The analysis of network routing games typically assumes, right at the onset, precise and detailed in...
This thesis deals with dynamic, load-adaptive rerouting policies in game theoretic settings. In the ...
Global communication networks like the Internet often lack a central authority that monitors and reg...
This article presents a multicommodity, discrete-time, distributed, and noncooperative routing algor...
In recent years there has been a growing interest in mathematical models for routing in networks in ...
iv This thesis deals with dynamic, load-adaptive rerouting policies in game theoretic settings. In t...
According to Wardrop's first principle, agents in a congested network choose their routes selfishly,...
There has been substantial work developing simple, efficient no-regret algorithms for a wide class o...
We study the question of whether a large population of agents in a traffic network is able to conver...
There has been substantial work developing simple, efficient no-regret algorithms for a wide class o...
Abstract. Network games can be used to model competitive situations in which agents select routes to...
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic ...
The goal of this paper is to find Wardrop equilibrium in transport networks at case of uncertainty s...
Abstract. Wardrop equilibria are commonly used as a solution concept of network games when modeling ...
A simple dynamics capturing user behavior in a network is shown to lead to equilibria that can be vi...
The analysis of network routing games typically assumes, right at the onset, precise and detailed in...
This thesis deals with dynamic, load-adaptive rerouting policies in game theoretic settings. In the ...