Algorithms for stochastic games-A survey

Algorithms for stochastic games-A survey

0.00 Avg rating0 Votes
Article ID: iaor19921438
Country: Germany
Volume: 35
Start Page Number: 437
End Page Number: 472
Publication Date: Jun 1991
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
Abstract:

The authors consider finite state, finite action, stochastic games over an infinite time horizon. They survey algorithms for the computation of minimax optimal stationary strategies in the zerosum case, and of Nash equilibria in statonary strategies in the nonzerosum case. The authors also survey those theoretical results that pave the way towards future development of algorithms.

Reviews

Required fields are marked *. Your email address will not be published.