Nash equilibria in discrete routing games with convex latency functions☆
Under an Elsevier user license
open archive
Keywords
Discrete routing games
Convex latency functions
Price of Anarchy
Fully mixed Nash equilibria
Cited by (0)
- ☆
A preliminary version of this work appeared in the Proceedings of the 31st International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 3142, Springer-Verlag, July 2004, pp. 645–657. This work has been partially supported by the IST Program of the European Union under contracts IST-2001-33116 (FLAGS), 001907 (DELIS) and 015964 (AEOLUS), by research funds at University of Cyprus, and by the VEGA grant No. 2/3164/23.
- 1
The work of this author was done while at the University of Paderborn.
- 2
Part of the work of this author was done while visiting the University of Paderborn.
- 3
International Graduate School of Dynamic Intelligent Systems, University of Paderborn, Germany.
Copyright © 2008 Elsevier Inc. All rights reserved.