Answers are grounded in this paper and cite their sources.
In this paper, we compare the value of zero-sum stochastic games under optimal strategies (that are, for single-controller stochastic games, stationary) to the commonly used time-independent strategies (“static strategies”). Our findings are summarized in a series of theorems which provide the lower bound on the optimality of the static strategy under different assumptions. These bounds can be used to assess whether the additional computational complexity is worth the extra payoff gain or, symmetrically, assess the price of playing sub-optimal but simple strategies when stationary ones are forbidden.
No takes yet. Share an insight, caveat, or question.
Tsodikovich et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: