An approximate computation of an optimal strategy in games with a fixed sequence of moves with incomplete information

DOI10.1016/0041-5553(79)90025-9zbMath0434.90115OpenAlexW2039929179MaRDI QIDQ3873975

A. D. Khalezov

Publication date: 1979

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(79)90025-9

zbMATH Keywords

optimal strategyincomplete informationapproximate computationhierarchical systemsgames with a fixed sequence of moves

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15)

Related Items (1)

A survey of Germeier's game theory

This page was built for publication: An approximate computation of an optimal strategy in games with a fixed sequence of moves with incomplete information