The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
- 25 June 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 123-134
- https://doi.org/10.1007/3-540-45465-9_12
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the complexity of equilibriaPublished by Association for Computing Machinery (ACM) ,2002
- The price of selfish routingPublished by Association for Computing Machinery (ACM) ,2001
- Algorithms, Games, and the InternetLecture Notes in Computer Science, 2001
- Chapter 2 Computation of equilibria in finite gamesHandbook of Computational Economics, 1996
- On the complexity of the parity argument and other inefficient proofs of existenceJournal of Computer and System Sciences, 1994
- On total functions, existence theorems and computational complexityTheoretical Computer Science, 1991
- Nash and correlated equilibria: Some complexity considerationsGames and Economic Behavior, 1989
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Equilibrium Points of Bimatrix GamesJournal of the Society for Industrial and Applied Mathematics, 1964
- Non-Cooperative GamesAnnals of Mathematics, 1951