Repeated Games with Switching Costs: Stationary vs History Independent Strategies

Yevgeny Tsodikovich, Xavier Venel and Anna Zseleva

Papers from arXiv.org

Abstract: We study zero-sum repeated games where the minimizing player has to pay a certain cost each time he changes his action. Our contribution is twofold. First, we show that the value of the game exists in stationary strategies, depending solely on the previous action of the minimizing player, not the entire history. We provide a full characterization of the value and the optimal strategies. The strategies exhibit a robustness property and typically do not change with a small perturbation of the switching costs. Second, we consider a case where the minimizing player is limited to playing simpler strategies that are completely history-independent. Here too, we provide a full characterization of the (minimax) value and the strategies for obtaining it. Moreover, we present several bounds on the loss due to this limitation.

Date: 2021-02, Revised 2021-10
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2103.00045 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2103.00045

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().