DeepAI AI Chat
Log In Sign Up

Pure Strategy Best Responses to Mixed Strategies in Repeated Games

by   Shiheng Wang, et al.
The Hong Kong University of Science and Technology

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.


page 1

page 2

page 3

page 4


Memory-two zero-determinant strategies in repeated games

We extend the concept of zero-determinant strategies to memory-two strat...

Stability of defection, optimisation of strategies and the limits of memory in the Prisoner's Dilemma

Memory-one strategies are a set of Iterated Prisoner's Dilemma strategie...

Chess Pure Strategies are Probably Chaotic

It is odd that chess grandmasters often disagree in their analysis of po...

Automated Configuration and Usage of Strategy Portfolios for Bargaining

Bargaining can be used to resolve mixed-motive games in multi-agent syst...

Evaluating Evasion Strategies in Zebrafish Larvae

An effective evasion strategy allows prey to survive encounters with pre...

Modelling Behavioural Diversity for Learning in Open-Ended Games

Promoting behavioural diversity is critical for solving games with non-t...

Mixed Strategy May Outperform Pure Strategy: An Initial Study

In pure strategy meta-heuristics, only one search strategy is applied fo...