2019/02/25 by Shiheng Wang, Fangzhen Lin, Wang, Shiheng +1
Computer Science · Decision Sciences · #Artificial Intelligence in Games #Auction Theory and Applications #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Applications
paper · pdf · doi:10.48550/arxiv.1902.09066
openalex publication_date 2019/02/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Repeated games are difficult to analyze, especially when agents play mixed strategies. We study one-memory strategies in iterated prisoner's dilemma, then generalize the result to k-memory strategies in repeated games. Our result shows that there always exists a pure strategy best response, which can be computed with SMT or MDP solvers. However, there may not exist such pure strategy best response in multi-agent tournaments. All source code is released for verification.