By Topic

Finite state stochastic games: Existence theorems and computational procedures

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)
Kushner, H.J. ; Brown University, Providence, RI, USA ; Chamberlain, S.

Let{X_{n}}be a Markov process with finite state space and transition probabilitiesp_{ij}(u_{i}, v_{i})depending on uiandv_{i}.State 0 is the capture state (where the game ends;p_{oi} equiv delta_{oi});u = {u_{i}}andv = {v_{i}}are the pursuer and evader strategies, respectively, and are to be chosen so that capture is advanced or delayed and the costC_{i^{u,v}} = E[Sum_{0}^{infty} k (u(X_{n}), v(X_{n}), X_{n}) | X_{0} = i]is minimaxed (or maximined), wherek(alpha, beta, 0) equiv 0. The existence of a saddle point and optimal strategy pair or e-optimal strategy pair is considered under several conditions. Recursive schemes for computing the optimal or ε-optimal pairs are given.

Published in:

Automatic Control, IEEE Transactions on  (Volume:14 ,  Issue: 3 )