Regret based dynamics: convergence in weakly acyclic games
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
On the structure of weakly acyclic games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Weakly-acyclic (internet) routing games
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Convergence of ordered improvement paths in generalized congestion games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Convergence of ordered improvement paths in generalized congestion games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On dynamics in selfish network creation
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Weakly-Acyclic (Internet) Routing Games
Theory of Computing Systems
| Hi-index | 0.00 |
Weakly acyclic games form a natural generalization of the class of games that have the finite improvement property (FIP). In such games one stipulates that from any initial joint strategy some finite improvement path exists. We classify weakly acyclic games using the concept of a scheduler recently introduced in [1].