DeepAI AI Chat
Log In Sign Up

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

by   Nikoleta E. Glynatsi, et al.

Memory-one strategies are a set of Iterated Prisoner's Dilemma strategies that have been acclaimed for their mathematical tractability and performance against single opponents. This manuscript investigates best responses to a collection of memory-one strategies as a multidimensional optimisation problem. Though extortionate memory-one strategies have gained much attention, we demonstrate that best response memory-one strategies do not behave in an extortionate way, and moreover, for memory one strategies to be evolutionary robust they need to be able to behave in a forgiving way. We also provide evidence that memory-one strategies suffer from their limited memory in multi agent interactions and can be out performed by longer memory strategies.


Pure Strategy Best Responses to Mixed Strategies in Repeated Games

Repeated games are difficult to analyze, especially when agents play mix...

Memory depth of finite state machine strategies for the iterated prisoner's dilemma

We develop an efficient algorithm to determine the memory-depth of finit...

Cooperative Pathfinding based on memory-efficient Multi-agent RRT*

In cooperative pathfinding problems, no-conflicts paths that bring sever...

Steering control of payoff-maximizing players in adaptive learning dynamics

Evolutionary game theory provides a mathematical foundation for cross-di...

Controlling conditional expectations by zero-determinant strategies

We show that memory-n zero-determinant strategies in repeated games can ...

Near-Optimal Adversarial Policy Switching for Decentralized Asynchronous Multi-Agent Systems

A key challenge in multi-robot and multi-agent systems is generating sol...

Optimal Heap Limits for Reducing Browser Memory Use

Garbage collected language runtimes must carefully tune heap limits to r...