Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games
From MaRDI portal
Publication:1627843
DOI10.1016/j.dam.2018.05.038zbMath1419.91067OpenAlexW2809610410WikidataQ129624998 ScholiaQ129624998MaRDI 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
Related Items (5)
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs ⋮ Characterization and simplification of optimal strategies in positive stochastic games ⋮ Positive zero-sum stochastic games with countable state and action spaces ⋮ Discrete stop-or-go games ⋮ Optimal Markov strategies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games