scientific article; zbMATH DE number 3887475

MaRDI QIDQ3221986zbMATH OpenFDO

Authors Charles Swart, Dana Richards

Publication date 1984

zbMATH Keywords

automata theorycounter machinefinite-state strategiesgraph traversal techniquesinfinite tournamentsnonzero-sum two-person gamesPrisoner's DilemmaTuring machine

Mathematics Subject Classification ID

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

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

Cited in

(12)

• Relevant aspects in two-person games
• On the inference of strategies
• The undecidability of the spatialized prisoner's dilemma
• Finding best counterstrategies for generalized iterated prisoner's dilemma games
• Efficient online algorithmic strategies for several two-player games with different or identical player roles
• scientific article; zbMATH DE number 3991303 (Why is no real title available?)
• Deriving and Analysing Optimal Strategies in Bayesian Models of Games
• Superior Information is Insufficient to Win in Games between Finite Automata
• Finding winning strategies in games on graphs
• An initial implementation of the Turing tournament to learning in repeated two-person games
• Some notes on Church's thesis and the theory of games
• Optimal values and strategies for a particular case of 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)