IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v14y2024i5d10.1007_s13235-024-00555-w.html
   My bibliography  Save this article

The Price of History-Independent Strategies in Games with Inter-Temporal Externalities

Author

Listed:
  • Yevgeny Tsodikovich

    (Bar Ilan University)

  • Xavier Venel

    (LUISS)

  • Anna Zseleva

    (Maastricht University)

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.

Suggested Citation

  • Yevgeny Tsodikovich & Xavier Venel & Anna Zseleva, 2024. "The Price of History-Independent Strategies in Games with Inter-Temporal Externalities," Dynamic Games and Applications, Springer, vol. 14(5), pages 1317-1332, November.
  • Handle: RePEc:spr:dyngam:v:14:y:2024:i:5:d:10.1007_s13235-024-00555-w
    DOI: 10.1007/s13235-024-00555-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-024-00555-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13235-024-00555-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lipman, Barton L. & Wang, Ruqu, 2000. "Switching Costs in Frequently Repeated Games," Journal of Economic Theory, Elsevier, vol. 93(2), pages 149-190, August.
    2. T. E. S. Raghavan & Zamir Syed, 2002. "Computing Stationary Nash Equilibria of Undiscounted Single-Controller Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 27(2), pages 384-400, May.
    3. Lipman, Barton L. & Wang, Ruqu, 2009. "Switching costs in infinitely repeated games," Games and Economic Behavior, Elsevier, vol. 66(1), pages 292-314, May.
    4. G. Schoenmakers & J. Flesch & F. Thuijsman & O. J. Vrieze, 2008. "Repeated Games with Bonuses," Journal of Optimization Theory and Applications, Springer, vol. 136(3), pages 459-473, March.
    5. G. Liuzzi & M. Locatelli & V. Piccialli & S. Rass, 2021. "Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems," Computational Optimization and Applications, Springer, vol. 79(3), pages 561-599, July.
    6. Chakrabarti, Subir K., 1990. "Characterizations of the equilibrium payoffs of inertia supergames," Journal of Economic Theory, Elsevier, vol. 51(1), pages 171-183, June.
    7. Stefan Rass & Sandra König & Stefan Schauer, 2017. "Defending Against Advanced Persistent Threats Using Game-Theory," PLOS ONE, Public Library of Science, vol. 12(1), pages 1-43, January.
    8. Jerzy A. Filar & T. E. S. Raghavan, 1984. "A Matrix Game Solution of the Single-Controller Stochastic Game," Mathematics of Operations Research, INFORMS, vol. 9(3), pages 356-362, August.
    9. Jasmin Wachter & Stefan Rass & Sandra König, 2018. "Security from the Adversary’s Inertia–Controlling Convergence Speed When Playing Mixed Strategy Equilibria," Games, MDPI, vol. 9(3), pages 1-15, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yevgeny Tsodikovich & Xavier Venel & Anna Zseleva, 2021. "Repeated Games with Switching Costs: Stationary vs History-Independent Strategies," Working Papers halshs-03223279, HAL.
    2. Yevgeny Tsodikovich & Xavier Venel & Anna Zseleva, 2021. "Repeated Games with Switching Costs: Stationary vs History-Independent Strategies," AMSE Working Papers 2129, Aix-Marseille School of Economics, France.
    3. Yevgeny Tsodikovich & Xavier Venel & Anna Zseleva, 2021. "Repeated Games with Switching Costs: Stationary vs History Independent Strategies," Papers 2103.00045, arXiv.org, revised Oct 2021.
    4. Yevgeny Tsodikovich & Xavier Venel & Anna Zseleva, 2022. "Folk Theorems in Repeated Games with Switching Costs," Working Papers hal-03888188, HAL.
    5. Lipman, Barton L. & Wang, Ruqu, 2009. "Switching costs in infinitely repeated games," Games and Economic Behavior, Elsevier, vol. 66(1), pages 292-314, May.
    6. Yu, Fengyuan & Wang, Jianwei & Chen, Wei & He, Jialu, 2023. "Increased cooperation potential and risk under suppressed strategy differentiation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 621(C).
    7. Guney, Begum & Richter, Michael, 2018. "Costly switching from a status quo," Journal of Economic Behavior & Organization, Elsevier, vol. 156(C), pages 55-70.
    8. Francesc Dilmé & Daniel F Garrett, 2019. "Residual Deterrence," Journal of the European Economic Association, European Economic Association, vol. 17(5), pages 1654-1686.
    9. Kurokawa, Shun, 2019. "How memory cost, switching cost, and payoff non-linearity affect the evolution of persistence," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 174-192.
    10. Dai Zusai, 2018. "Tempered best response dynamics," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 1-34, March.
    11. Aramendia, Miguel & Wen, Quan, 2020. "Myopic perception in repeated games," Games and Economic Behavior, Elsevier, vol. 119(C), pages 1-14.
    12. Dilmé, Francesc, 2019. "Reputation building through costly adjustment," Journal of Economic Theory, Elsevier, vol. 181(C), pages 586-626.
    13. Barton L. Lipman & Ruqu Wang, 2006. "Switching Costs in Infinitely Repeated Games1," Boston University - Department of Economics - Working Papers Series WP2006-003, Boston University - Department of Economics.
    14. Luca Lambertini & Raimondello Orsini, 2013. "On Hotelling's ‘stability in competition’ with network externalities and switching costs," Papers in Regional Science, Wiley Blackwell, vol. 92(4), pages 873-883, November.
    15. Norman, Thomas W.L., 2009. "Rapid evolution under inertia," Games and Economic Behavior, Elsevier, vol. 66(2), pages 865-879, July.
    16. Anoop R. Menon & Dennis A. Yao, 2017. "Elevating Repositioning Costs: Strategy Dynamics and Competitive Interactions," Strategic Management Journal, Wiley Blackwell, vol. 38(10), pages 1953-1963, October.
    17. İzgi, Burhaneddin & Özkaya, Murat & Üre, Nazım Kemal & Perc, Matjaž, 2024. "Matrix norm based hybrid Shapley and iterative methods for the solution of stochastic matrix games," Applied Mathematics and Computation, Elsevier, vol. 473(C).
    18. Hitoshi Matsushima, 2012. "Finitely Repeated Prisoners' Dilemma With Small Fines: The Penance Contract," The Japanese Economic Review, Japanese Economic Association, vol. 63(3), pages 333-347, September.
    19. Dutta, Rohan & Ishii, Ryosuke, 2016. "Dynamic commitment games, efficiency and coordination," Journal of Economic Theory, Elsevier, vol. 163(C), pages 699-727.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:dyngam:v:14:y:2024:i:5:d:10.1007_s13235-024-00555-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.