The complexity of computing a best response automaton in repeated games with mixed strategies
type: Item
instance of: scholarly article
title: The complexity of computing a best response automaton in repeated games with mixed strategies
zbMATH Open document ID: 0753.90088
DOI: 10.1016/0899-8256(90)90010-R
author: Elchanan Ben-Porath
published in: Games and Economic Behavior
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 91A20
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 65216
zbMATH Keywords: best response automaton
zbMATH Keywords: two-person repeated game
zbMATH Keywords: incomplete information
MaRDI profile type: Publication
cites work: Q4091421
cites work: Subjectivity and correlation in randomized strategies
cites work: Correlated Equilibrium as an Expression of Bayesian Rationality
cites work: Rationalizable Strategic Behavior
cites work: Rationalizability and Correlated Equilibria
cites work: Q4198056
cites work: The complexity of computing best-response automata in repeated games
cites work: Q3048571
cites work: Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
cites work: Rationalizable Strategic Behavior and the Problem of Perfection
cites work: Finite automata play the repeated prisoner's dilemma
full work available at URL: 0899-8256(90)90010-r
OpenAlex ID: W1989538212
description: scientific article; zbMATH DE number 65216