By Topic

Algorithms for solution of a class of stochastic games

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gruver, W.A. ; North Carolina State University, Raleigh, NC ; Dasgupta, P.

This paper treats the computational solution of terminating stochastic games using concepts from deterministic matrix games and Markovian decision processes. The algorithms due to Shapley and Pollatschek/ Avi-Itzhak are discussed and a suboptimal approach suitable for large problems is presented. Numerical results are given from an example comparing the three approaches.

Published in:

Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications, 1977 IEEE Conference on

Date of Conference:

7-9 Dec. 1977