scientific article; zbMATH DE number 3887475

zbMATH Open0556.90097MaRDI QIDQ3221986FDOQ3221986

Authors: Charles Swart, Dana Richards 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• On the inference of strategies
• Finite automata play the repeated prisoner's dilemma
• Games of stochastic automata
• Finding best counterstrategies for generalized iterated prisoner's dilemma games
• Non-computable strategies and discounted repeated games

zbMATH Keywords

automata theoryTuring machinePrisoner's Dilemmacounter machinenonzero-sum two-person gamesinfinite tournamentsfinite-state strategiesgraph traversal techniques

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) 2-person games (91A05) Multistage and repeated games (91A20) Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35)

Cited In (10)

• Finding winning strategies in games on graphs
• Efficient online algorithmic strategies for several two-player games with different or identical player roles
• An initial implementation of the Turing tournament to learning in repeated two-person games
• Deriving and Analysing Optimal Strategies in Bayesian Models of Games
• On the inference of strategies
• Title not available (Why is that?)
• Finding best counterstrategies for generalized iterated prisoner's dilemma games
• Optimal values and strategies for a particular case of two-person games
• Some notes on Church's thesis and the theory of games
• Relevant aspects in two-person games

This page was built for publication:

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