Paper Info
Title
Retrograde Approximation Algorithms For Jeopardy Stochastic Games
Abstract
We study algorithms for solving one-player and two-player stochastic games with perfect information. by modelling a game as a finite, possibly cyclic graph. We analyze a family of jeopardy stochastic games prove the existence and uniqueness of optimal solutions. and give approximation algorithms to solve them by incorporating Newton's method into retrograde analysis. Examples of jeopardy stochastic games include Can't Stop, Pig, and some variants. Results of experiments oil small versions of the game Can't Stop are presented.
Year
Venue
Field
2008
ICGA JOURNAL
Approximation algorithm,Applied mathematics,Mathematical optimization,Computer science,Artificial intelligence,Stochastic approximation
DocType
Volume
Issue
Journal
31
2
ISSN
Citations 
PageRank 
1389-6911
0
0.34
References 
Authors
4
3
Name
Order
Citations
PageRank
Haw-ren Fang113213.24
James Glenn2215.08
Clyde P. Kruskal3796136.49