2015/01/26 by Sven Schewe, Ashutosh Trivedi, Schewe, Sven +3
Computer Science · Decision Sciences · #Artificial Intelligence in Games #Computability, Logic, AI Algorithms #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Applications
paper · pdf · doi:10.48550/arxiv.1501.06484
openalex publication_date 2015/01/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Symmetry is inherent in the definition of most of the two-player zero-sum games, including parity, mean-payoff, and discounted-payoff games. It is therefore quite surprising that no symmetric analysis techniques for these games exist. We develop a novel symmetric strategy improvement algorithm where, in each iteration, the strategies of both players are improved simultaneously. We show that symmetric strategy improvement defies Friedmann's traps, which shook the belief in the potential of classic strategy improvement to be polynomial.