Dimitris Fotakis, Spyros Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul Spirakis  Home/Search
Context Related
| cs.uoi.gr/~kontog/pubs/icalp02.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.uoi.gr/~kontog/index (more) Homepages: S.Kontogiannis |
Rate this article:      (best)Comment on this article |
Abstract: In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection of n users, each employing a mixed strategy, which is a probability distribution over links, to control the routing of its own assigned traffic. In a Nash equilibrium, each user selfishly routes its traffic on those links that minimize its expected latency cost, given the... (Update)
Cited by: More
Computing Equilibria for Congestion Games - With Im Perfect (Correct)
Unknown - (Correct)
Efficient Convergence to Pure Nash Equilibria in Weighted .. - Panagopoulou, Spirakis (2005) (Correct)
Similar documents (at the sentence level):
34.9%: The Structure and Complexity of Nash Equilibria.. - Fotakis.. (2002) (Correct)
Active bibliography (related documents): More All
0.3: Games Computers Play: Game-Theoretic Aspects of Computing - Linial (1992) (Correct)
0.2: Integer Polyhedra: Combinatorial Properties and Complexity - Sebö (2001) (Correct)
0.2: Playing Large Games using Simple Strategies - Lipton, Markakis, Mehta (2003) (Correct)
Similar documents based on text:
0.3: Evolutionary Games: An Algorithmic View - Kontogiannis, Spirakis (Correct)
Related documents from co-citation: More All
11: The price of selfish routing (context) - Mavronicolas, Spirakis - 2001
9: Tight bounds for worst-case equilibria - Czumaj, Voecking - 2002
8: Worst-case Equilibria - Koutsoupias, Papadimitriou - 1999
BibTeX entry: (Update)
Fotakis D. and Kontogiannis S. and Koutsoupias E. and Mavronicolas M. and Spirakis P. The structure and complexity of nash equilibria for a selfish routing game. In Proc. of the 29th International Colloquium on Automata, Languages and Programming (ICALP '02), pages 123--134. Springer-Verlag, 2002. http://citeseer.ist.psu.edu/fotakis02structure.html More
@inproceedings{ fotakis02structure,
author = "D. Fotakis and S. Kontogiannis and E. Koutsoupias and M. Mavronicolas and
P. Spirakis",
title = "The structure and complexity of {Nash} equilibria for a selfish routing game",
booktitle = "Proc. of the 29th International Colloquium on Automata, Languages
and Programming (ICALP '02)",
pages = "123--134",
publisher = "Springer-Verlag",
year = "2002",
url = "citeseer.ist.psu.edu/fotakis02structure.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
282 A Course in Game Theory (context) - Osborne, Rubinstein - 1994
219 Bounds on Multiprocessing Timing Anomalies (context) - Graham - 1969
125 Non-cooperative Games (context) - Nash - 1951
50 Equilibrium Points of Bimatrix Games (context) - Lemke, Howson - 1964
41 Oxford Science Publications (context) - Grimmett, Stirzaker et al. - 1992
40 Tight Bounds for Worst-Case Equilibria - Czumaj, ocking - 2002
26 Computation of Equilibria in Finite Games - McKelvey, McLennan - 1996
24 Nash and Correlated Equilibria: Some Complexity Consideratio.. (context) - Gilboa, Zemel - 1989
14 the Complexity of Equilibria - Deng, Papadimitriou et al. - 2002
14 the Complexity of the Parity Argument and Other Inecient Pro.. (context) - Papadimitriou - 1994
5 Theoretical Computer Science (context) - Megiddo, Papadimitriou et al. - 1991
3 IBM Almaden Research Center (context) - Megiddo, on et al. - 1988
3 Personal Communication (context) - Monien - 2002
3 Computing Equlibria for Two-Person Games (context) - von Stengel - 1998
2 Proceedings of the 33rd Annual ACM Symposium on Theory of Co.. (context) - Mavronicolas, Spirakis et al. - 2001
2 Proceedings of the 16th Symposium on Theoretical Aspects of .. (context) - Koutsoupias, Papadimitriou et al. - 1999
2 Proceedings of the 28th International Colloquium on Automata (context) - Papadimitriou, Games et al. - 2001
2 Proceedings of the 9th International Colloquium on Structura.. (context) - Koutsoupias, Mavronicolas et al. - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uoi.gr/~kontog/index.htm): More
Evolutionary Games: What is the algorist's perspective? - Kontogiannis, Spirakis (Correct)
Selfish Unsplittable Flows - Fotakis, Kontogiannis, Spirakis (2004) (Correct)
Efficient Computations on fault-prone BSP machines - Kontogiannis, Pantziou.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC