2012/06/01 by Krzysztof R. Apt, Apt, Krzysztof R., Sunil Simon +1
Decision Sciences · Social Sciences · #Computer Science and Game Theory (cs.GT) #Evolutionary Game Theory and Cooperation #Experimental Behavioral Economics Studies #FOS: Computer and information sciences #Game Theory and Applications
paper · pdf · doi:10.48550/arxiv.1206.0130
openalex publication_date 2012/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.