Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games

DOI10.1016/j.dam.2018.05.038zbMath1419.91067MaRDI QIDQ1627843

Arkadi Predtetchinski, Janos Flesch, William D. Sudderth

Publication date: 3 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.038

zbMATH Keywords

optimal strategy; zero-sum game; stochastic game; stationary strategy

Mathematics Subject Classification ID

91A05: 2-person games

91A15: Stochastic games, stochastic differential games

Related Items

Characterization and simplification of optimal strategies in positive stochastic games, Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs, Optimal Markov strategies, Discrete stop-or-go games, Positive zero-sum stochastic games with countable state and action spaces

Cites Work

• On values of repeated games with signals
• A survey of stochastic \(\omega \)-regular games
• Borel stochastic games with lim sup payoff
• An operator solution of stochastic games
• On stationary policies - the general case
• On the existence of good stationary strategies for nonleavable stochastic games
• Computer aided synthesis: a game-theoretic approach
• Pure Stationary Optimal Strategies in Markov Decision Processes
• A Survey of Stochastic Games with Limsup and Liminf Objectives
• Gambling Problems with a Limit Inferior Payoff
• Simplifying Optimal Strategies in Stochastic Games
• The determinacy of Blackwell games
• MARKOV STRATEGIES ARE BETTER THAN STATIONARY STRATEGIES
• The Big Match
• Stochastic Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item