Advertisement
Published in:
2012 | OriginalPaper | Chapter
Convergence of Ordered Improvement Paths in Generalized Congestion Games
Authors : K. Ruben Brokkelkamp, Mees J. de Vries
Published in: Algorithmic Game Theory
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We consider generalized congestion games, a class of games in which players share a set of strategies and the payoff functions depend only on the chosen strategy and the number of players playing the same strategy, in such a way that fewer such players results in greater payoff. In these games we consider improvement paths. As shown by Milchtaich [2] such paths may be infinite. We consider paths in which the players deviate in a specific order, and prove that ordered best response improvement paths are finite, while ordered better response improvement paths may still be infinite.