Paper Info
Title
Stationary Strategies for Recursive Games
Abstract
We study two-person, zero-sum recursive matrix games framing them in the more general context of nonleavable games. Our aim is to extend a result of Orkin Orkin, M. 1972. Recursive matrix games. J. Appl. Probab.9 813--820. by proving that a uniformly ε-optimal stationary strategy is available to player I player II in any recursive game such that the set where the value of the game is strictly greater less than its utility is finite. The proof exploits some new connections between nonleavable and leavable games. In particular we find sufficient conditions for the existence of ε-optimal stationary strategies for player I in a leavable game and we use these as a basis for constructing uniformly ε-optimal stationary strategies for the recursive games with which we are concerned.
Year
DOI
Venue
1997
10.1287/moor.22.2.494
Math. Oper. Res.
Keywords
DocType
Volume
recursive game,stationary strategy
Journal
22
Issue
ISSN
Citations 
2
0364-765X
1
PageRank 
References 
Authors
0.44
0
1
Name
Order
Citations
PageRank
Piercesare Secchi17011.12