MARKOV STRATEGIES ARE BETTER THAN STATIONARY STRATEGIES

DOI10.1142/S0219198999000037zbMath0943.91010MaRDI QIDQ4485671

O. J. Vrieze, Frank Thuijsman, Janos Flesch

Publication date: 19 June 2000

Published in: International Game Theory Review (Search for Journal in Brave)

zbMATH Keywords

zero-sum stochastic gamesstationary strategiesMarkov strategies

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15)

Related Items (3)

Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games ⋮ STATIONARY STRATEGIES IN ZERO-SUM STOCHASTIC GAMES ⋮ Adaptive policy for two finite Markov chains zero-sum stochastic game with unknown transition matrices and average payoffs

Cites Work

• Semi-Markov strategies in stochastic games
• On stochastic games with additive reward and transition structure
• Ordered field property for stochastic games when the player who controls transitions changes from state to state
• Repeated games with absorbing states and no signals
• Repeated games with absorbing states
• Stationary \(\varepsilon\)-optimal strategies in stochastic games
• Simplifying Optimal Strategies in Stochastic Games
• The Big Match
• Stochastic Games with Perfect Information and Time Average Payoff
• Noncooperative Stochastic Games
• Stochastic games

This page was built for publication: MARKOV STRATEGIES ARE BETTER THAN STATIONARY STRATEGIES