Selfish routing with incomplete information
Authors:
Open Access
- 18 July 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 203-212
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Game Theory Meets Theoretical Computer ScienceTheoretical Computer Science, 2005
- Selfish Unsplittable FlowsLecture Notes in Computer Science, 2004
- A New Model for Selfish RoutingLecture Notes in Computer Science, 2004
- Approximate Equilibria and Ball FusionTheory of Computing Systems, 2003
- CONGESTION GAMES AND POTENTIALS RECONSIDEREDInternational Game Theory Review, 1999
- Potential GamesGames and Economic Behavior, 1996
- Congestion Games with Player-Specific Payoff FunctionsGames and Economic Behavior, 1996
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973
- Games with randomly disturbed payoffs: A new rationale for mixed-strategy equilibrium pointsInternational Journal of Game Theory, 1973
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969