19 search results - page 1 / 4 » Approximating Wardrop Equilibria with Finitely Many Agents |
WDAG
2007
Springer
13 years 10 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
STOC
2006
ACM
14 years 4 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
PE
2002
Springer
13 years 3 months ago
2002
Springer
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
In this paper we study stochastic dynamic games with many players that are relevant for a wide range of social, economic, and engineering applications. The standard solution conce...
MFCS
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [3...