Total Latency in Singleton Congestion Games
Authors:
- 3 December 2007
- book chapter
- Published by Springer Nature
- p. 381-387
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Tight bounds for worst-case equilibriaACM Transactions on Algorithms, 2007
- THE PRICE OF ANARCHY FOR RESTRICTED PARALLEL LINKSParallel Processing Letters, 2006
- Exact Price of Anarchy for Polynomial Congestion GamesLecture Notes in Computer Science, 2006
- Tight Bounds for Selfish and Greedy Load Balancing2006
- Selfish routing with incomplete information2005
- The price of anarchy of finite congestion games2005
- A Simple Graph-Theoretic Model for Selfish Restricted SchedulingLecture Notes in Computer Science, 2005
- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,2005
- Nash Equilibria in Discrete Routing Games with Convex Latency Functions2004
- The Structure and Complexity of Nash Equilibria for a Selfish Routing Game2002