Performances of One-Round Walks in Linear Congestion Games
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Characterizing the Existence of Potential Functions in Weighted Congestion GamesLecture Notes in Computer Science, 2009
- The Speed of Convergence in Congestion Games under Best-Response DynamicsLecture Notes in Computer Science, 2008
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of AnarchyLecture Notes in Computer Science, 2008
- Algorithms for pure Nash equilibria in weighted congestion gamesACM Journal of Experimental Algorithmics, 2007
- Tight Bounds for Selfish and Greedy Load BalancingLecture Notes in Computer Science, 2006
- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,Lecture Notes in Computer Science, 2005
- Convergence Issues in Competitive GamesLecture Notes in Computer Science, 2004
- Potential GamesGames and Economic Behavior, 1996
- How easy is local search?Journal of Computer and System Sciences, 1988
- A class of games possessing pure-strategy Nash equilibriaInternational Journal of Game Theory, 1973