Abstract
We study repeated zero-sum games where one of the players pays a certain cost each time he changes his action. We derive the properties of the value and optimal strategies as a function of the ratio between the switching costs and the stage payoffs. In particular, the strategies exhibit a robustness property and typically do not change with a small perturbation of this ratio. Our analysis extends partially to the case where the players are limited to simpler strategies that are history independent-namely, static strategies. In this case, we also characterize the (minimax) value and the strategies for obtaining it.
Original language | English |
---|---|
Pages (from-to) | 1899-1905 |
Number of pages | 7 |
Journal | Mathematics of Operations Research |
Volume | 48 |
Issue number | 4 |
DOIs | |
State | Published - 1 Jan 2023 |
Externally published | Yes |
Keywords
- repeated games
- stochastic games
- switching costs
- zero-sum games
ASJC Scopus subject areas
- General Mathematics
- Computer Science Applications
- Management Science and Operations Research