A classification of weakly acyclic games
From MaRDI portal
Publication:2353596
Abstract: 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 introduced in arXiv:1202.2209. We also show that finite games that can be solved by the iterated elimination of never best response strategies are weakly acyclic. Finally, we explain how the schedulers allow us to improve the bounds on finding a Nash equilibrium in a weakly acyclic game.
Recommendations
Cites work
- A classification of weakly acyclic games
- Congestion games with player-specific payoff functions
- Convergence of Ordered Improvement Paths in Generalized Congestion Games
- scientific article; zbMATH DE number 5869590 (Why is no real title available?)
- On a network creation game
- Potential games
- Rationalizable Strategic Behavior
- The Evolution of Conventions
- Weakly-Acyclic (Internet) Routing Games
Cited in
(8)- On the IENBR-solvability of two-person finite games
- Game theoretic analysis of self-stabilizing systems on arrays
- Gibbard-Satterthwaite games for k-approval voting rules
- A classification of weakly acyclic games
- Coordination games on weighted directed graphs
- Games with a Weak Adversary
- Best-response dynamics, playing sequences, and convergence to equilibrium in random games
- Quantifying the likelihood of learning collusive strategy equilibria
This page was built for publication: A classification of weakly acyclic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2353596)
