The Regularity of the Value Function of Repeated Games with Switching Costs

Published Online:https://doi.org/10.1287/moor.2022.1325

References

  • [1] Darlington M, Glazebrook KD, Leslie DS, Shone R, Szechtman R (2022) A stochastic game framework for patrolling a border. Preprint, submitted May 20, https://doi.org/10.48550/arXiv.2205.10017.Google Scholar
  • [2] Filar J (1980) Algorithms for solving some undiscounted stochastic games. PhD thesis, University of Illinois at Chicago Circle, Chicago.Google Scholar
  • [3] Filar J, Raghavan T (1984) A matrix game solution of the single-controller stochastic game. Math. Oper. Res. 9(3):356–362.LinkGoogle Scholar
  • [4] Filar J, Schultz T (1986) The traveling inspector model. Oper.-Res.-Spektrum 8(1):33–36.CrossrefGoogle Scholar
  • [5] Lipman B, Wang R (2000) Switching costs in frequently repeated games. J. Econom. Theory 93(2):149–190.CrossrefGoogle Scholar
  • [6] Lipman B, Wang R (2009) Switching costs in infinitely repeated games. Games Econom. Behav. 66(1):292–314.CrossrefGoogle Scholar
  • [7] Liuzzi G, Locatelli M, Piccialli V, Rass S (2021) Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems. Comput. Optim. Appl. 79(3):561–599.CrossrefGoogle Scholar
  • [8] Raghavan TES (2003) Finite-step algorithms for single-controller and perfect information stochastic games. Neyman A, Sorin S, eds. Stochastic Games and Applications (Springer, Dordrecht, Netherlands), 227–251.CrossrefGoogle Scholar
  • [9] Raghavan TES, Syed Z (2002) Computing stationary Nash equilibria of undiscounted single-controller stochastic games. Math. Oper. Res. 27(2):384–400.LinkGoogle Scholar
  • [10] Rass S, Rainer B (2014) Numerical computation of multi-goal security strategies. Poovendran R, Saad W, eds. Proc. 5th Internat. Conf. Decision Game Theory Security (Springer, Cham, Switzerland), 118–133.Google Scholar
  • [11] Rass S, König S, Schauer S (2017) Defending against advanced persistent threats using game-theory. PLoS One 12(1):e0168675.CrossrefGoogle Scholar
  • [12] Schoenmakers G, Flesch J, Thuijsman F, Vrieze O (2008) Repeated games with bonuses. J. Optim. Theory Appl. 136(3):459–473.CrossrefGoogle Scholar
  • [13] Shapley L, Snow R (1950) Basic solutions of discrete games. Kuhn HW, Tucker AW, eds. Contributions to the Theory of Games, Vol. 1, Annals of Mathematics Studies, No. 24 (Princeton University Press, Princeton, NJ), 27–36.Google Scholar
  • [14] Xu H, Ford B, Fang F, Dilkina B, Plumptre A, Tambe M, Driciru M, et al. (2017) Optimal patrol planning for green security games with black-box attackers. Proc. 8th Internat. Conf. Decision Game Theory Security (Springer, Cham, Switzerland), 458–477.Google Scholar
  • [15] Yavuz M, Jeffcoat D (2007) An analysis and solution of the sensor scheduling problem. Pardalos PM, Murphey R, Grundel D, Hirsch MJ, eds. Advances in Cooperative Control and Optimization (Springer, Berlin), 167–177.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.