Bounded computational capacity equilibrium in repeated two-player zero-sum games

DOI10.1142/S021919891750013XMaRDI QIDQ4593826zbMATH OpenOpenAlexFDO

Authors O. V. Baskov

Publication date 15 November 2017

Published in International Game Theory Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s021919891750013x

zbMATH Keywords

finite automatagame theoryrepeated gameszero-sum games

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 2-person games (91A05) Multistage and repeated games (91A20)

Recommendations

• Equilibrium payoffs in repeated two-player zero-sum games of finite automata
• Bounded computational capacity equilibrium
• Repeated games with finite automata
• Finitely repeated games with finite automata
• Two-person repeated games with finite automata

Cites work

• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Bounded computational capacity equilibrium
• Finite automata play the repeated prisoner's dilemma
• Repeated games with finite automata

Cited in

(5)

• Computational ability in games: individual difference and dynamics
• Equilibrium payoffs in repeated two-player zero-sum games of finite automata
• Bounded computational capacity equilibrium
• Optimality and domination in repeated games with bounded players
• Excludability and Bounded Computational Capacity

This page was built for publication: Bounded computational capacity equilibrium in repeated two-player zero-sum games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593826)