Little perfection and complexity
type: Item
instance of: scholarly article
title: Little perfection and complexity
zbMATH Open document ID: 0799.90137
DOI: 10.1007/BF01240128
author: Alejandro Neme
published in: International Journal of Game Theory
publication date: 1994-01-26T00:00:00Z
Mathematics Subject Classification ID: 91A20
zbMATH DE Number: 490746
zbMATH Keywords: infinitely-repeated prisoners' dilemma
zbMATH Keywords: lexicographic complexity costs
zbMATH Keywords: off-equilibrium path payoff
MaRDI profile type: Publication
cites work: The Structure of Nash Equilibrium in Repeated Games with Finite Automata
cites work: Repeated games, finite automata, and complexity
cites work: Q3351186
cites work: The strength of a little perfection
cites work: Finite Rationality and Interpersonal Complexity in Repeated Games
cites work: Finite automata play the repeated prisoner's dilemma
full work available at URL: https://doi.org/10.1007/bf01240128
OpenAlex ID: W1968956196
description: scientific article; zbMATH DE number 490746