Smale Strategies For The N-Person Iterated Prisoner's Dilemma

02/11/2018
by   Ethan Akin, et al.
0

Adapting methods introduced by Steven Smale, we describe good strategies for a symmetric version of the Iterated Prisoner's Dilemma with n players.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2023

The Worst-Case Complexity of Symmetric Strategy Improvement

Symmetric strategy improvement is an algorithm introduced by Schewe et a...
research
08/05/2021

Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoner's dilemma game

We investigate symmetric equilibria of mutual reinforcement learning whe...
research
12/14/2017

Equilibria in the Tangle

We analyse the Tangle --- a DAG-valued stochastic process where new vert...
research
02/23/2022

Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

We prove that a deterministic n-person shortest path game has a Nash equ...
research
06/24/2022

Notes on presheaf representations of strategies and cohomological refinements of k-consistency and k-equivalence

In this note, we show how positional strategies for k-pebble games have ...
research
03/15/2012

Learning Game Representations from Data Using Rationality Constraints

While game theory is widely used to model strategic interactions, a natu...
research
11/05/2017

Strategies for Conceptual Change in Convolutional Neural Networks

A remarkable feature of human beings is their capacity for creative beha...

Please sign up or login with your details

Forgot password? Click here to reset