Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 1317-1332 |
Number of pages | 16 |
Journal | Dynamic Games and Applications |
Volume | 14 |
Issue number | 5 |
Early online date | 2 Mar 2024 |
DOIs | |
Publication status | Published - Nov 2024 |
JEL classifications
- c72 - Noncooperative Games
- c73 - "Stochastic and Dynamic Games; Evolutionary Games; Repeated Games"
Keywords
- switching costs
- zero-sum games
- Repeated games
- Stochastic games
- Switching costs
- Zero-sum games