When is tit-for-tat unbeatable?

We characterize the class of symmetric two-player games in which tit-for-tat cannot be beaten even by very sophisticated opponents in a repeated game. It turns out to be the class of exact potential games. More generally, there is a class of simple imitation rules that includes tit-for-tat but also...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Dürsch, Peter (Autor) , Oechssler, Joerg (Autor) , Schipper, Burkhard (Autor)
Formato: Article (Journal)
Lenguaje:inglés
Publicado: 2014
In: International journal of game theory
Year: 2013, Volumen: 43, Número: 1, Pages: 25-36
ISSN:1432-1270
DOI:10.1007/s00182-013-0370-1
Acceso en línea:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1007/s00182-013-0370-1
Enlace del recurso
Notas de Autor:Peter Duersch · Jörg Oechssler · Burkhard C. Schipper
Search Result 1

When is tit-for-tat unbeatable? por Dürsch, Peter (Autor) , Oechssler, Joerg (Autor) , Schipper, Burkhard (Autor) ,


Enlace del recurso
Article (Journal)