6 search results - page 1 / 2 » Wardrop Equilibria with Risk-Averse Users |
TRANSCI
2010
13 years 9 months ago
2010
WDAG
2007
Springer
14 years 5 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...
CN
2010
13 years 11 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
PE
2002
Springer
13 years 10 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...
MFCS
2004
Springer
14 years 4 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...