Nash Equilibria in Discrete Routing Games with Convex Latency Functions
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 645-657
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Approximate Equilibria and Ball FusionTheory of Computing Systems, 2003
- How bad is selfish routing?Journal of the ACM, 2002
- Congestion Games with Player-Specific Payoff FunctionsGames and Economic Behavior, 1996
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation ApproachSIAM Journal on Computing, 1988
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Über ein Paradoxon aus der VerkehrsplanungMathematical Methods of Operations Research, 1968
- ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.Proceedings of the Institution of Civil Engineers, 1952
- Non-Cooperative GamesAnnals of Mathematics, 1951
- Exponential NumbersThe American Mathematical Monthly, 1934