Nash Equilibria in a class of Markov stopping games

Rolando Cavazos-Cadena; Daniel Hernández-Hernández

Kybernetika (2012)

  • Volume: 48, Issue: 5, page 1027-1044
  • ISSN: 0023-5954

Abstract

top
This work concerns a class of discrete-time, zero-sum games with two players and Markov transitions on a denumerable space. At each decision time player II can stop the system paying a terminal reward to player I and, if the system is no halted, player I selects an action to drive the system and receives a running reward from player II. Measuring the performance of a pair of decision strategies by the total expected discounted reward, under standard continuity-compactness conditions it is shown that this stopping game has a value function which is characterized by an equilibrium equation, and such a result is used to establish the existence of a Nash equilibrium. Also, the method of successive approximations is used to construct approximate Nash equilibria for the game.

How to cite

top

Cavazos-Cadena, Rolando, and Hernández-Hernández, Daniel. "Nash Equilibria in a class of Markov stopping games." Kybernetika 48.5 (2012): 1027-1044. <http://eudml.org/doc/251394>.

@article{Cavazos2012,
abstract = {This work concerns a class of discrete-time, zero-sum games with two players and Markov transitions on a denumerable space. At each decision time player II can stop the system paying a terminal reward to player I and, if the system is no halted, player I selects an action to drive the system and receives a running reward from player II. Measuring the performance of a pair of decision strategies by the total expected discounted reward, under standard continuity-compactness conditions it is shown that this stopping game has a value function which is characterized by an equilibrium equation, and such a result is used to establish the existence of a Nash equilibrium. Also, the method of successive approximations is used to construct approximate Nash equilibria for the game.},
author = {Cavazos-Cadena, Rolando, Hernández-Hernández, Daniel},
journal = {Kybernetika},
keywords = {zero-sum stopping game; equality of the upper and lower value functions; contractive operator; hitting time; stationary strategy; zero-sum stopping game; equality of the upper and lower value functions; contractive operator; hitting time; stationary strategy},
language = {eng},
number = {5},
pages = {1027-1044},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Nash Equilibria in a class of Markov stopping games},
url = {http://eudml.org/doc/251394},
volume = {48},
year = {2012},
}

TY - JOUR
AU - Cavazos-Cadena, Rolando
AU - Hernández-Hernández, Daniel
TI - Nash Equilibria in a class of Markov stopping games
JO - Kybernetika
PY - 2012
PB - Institute of Information Theory and Automation AS CR
VL - 48
IS - 5
SP - 1027
EP - 1044
AB - This work concerns a class of discrete-time, zero-sum games with two players and Markov transitions on a denumerable space. At each decision time player II can stop the system paying a terminal reward to player I and, if the system is no halted, player I selects an action to drive the system and receives a running reward from player II. Measuring the performance of a pair of decision strategies by the total expected discounted reward, under standard continuity-compactness conditions it is shown that this stopping game has a value function which is characterized by an equilibrium equation, and such a result is used to establish the existence of a Nash equilibrium. Also, the method of successive approximations is used to construct approximate Nash equilibria for the game.
LA - eng
KW - zero-sum stopping game; equality of the upper and lower value functions; contractive operator; hitting time; stationary strategy; zero-sum stopping game; equality of the upper and lower value functions; contractive operator; hitting time; stationary strategy
UR - http://eudml.org/doc/251394
ER -

References

top
  1. Altman, E., Shwartz, A., Constrained Markov Games: Nash Equilibria., In: Annals of Dynamic Games (V. Gaitsgory, J. Filar and K. Mizukami, eds.) 6 (2000), pp. 213-221, Birkhauser, Boston. Zbl0957.91014MR1764491
  2. Atar, R., Budhiraja, A., 10.1214/09-AOP494, Ann. Probab. 2 (2010), 498-531. MR2642884DOI10.1214/09-AOP494
  3. Bielecki, T., Hernández-Hernández, D., Pliska, S. R., 10.1007/s001860050094, Mathe. Methods Oper. Res. 50 (1999), 167-188. Zbl0959.91029MR1732397DOI10.1007/s001860050094
  4. Dynkin, E. B., The optimum choice for the instance for stopping Markov process., Soviet. Math. Dokl. 4 (1963), 627-629. 
  5. Kolokoltsov, V. N., Malafeyev, O. A., Understanding Game Theory., World Scientific, Singapore 2010. Zbl1189.91001MR2666863
  6. Peskir, G., 10.1111/j.0960-1627.2005.00214.x, Math. Finance 15 (2010), 169-181. Zbl1109.91028MR2116800DOI10.1111/j.0960-1627.2005.00214.x
  7. Peskir, G., Shiryaev, A., Optimal Stopping and Free-Boundary Problems., Birkhauser, Boston 2010. Zbl1115.60001MR2256030
  8. Puterman, M., Markov Decision Processes., Wiley, New York 1994. Zbl1184.90170MR1270015
  9. Shiryaev, A., Optimal Stopping Rules., Springer, New York 1978. Zbl1138.60008MR0468067
  10. Sladký, K., Ramsey Growth model under uncertainty., In: Proc. 27th International Conference Mathematical Methods in Economics (H. Brozová, ed.), Kostelec nad Černými lesy 2009, pp. 296-300. 
  11. Sladký, K., Risk-sensitive Ramsey Growth model., In: Proc. of 28th International Conference on Mathematical Methods in Economics (M. Houda and J. Friebelová, eds.) České Budějovice 2010. 
  12. Shapley, L. S., 10.1073/pnas.39.10.1095, Proc. Nat. Acad. Sci. U.S.A. 39 (1953), 1095-1100. Zbl1180.91042MR0061807DOI10.1073/pnas.39.10.1095
  13. Wal, J. van der, 10.1007/BF01770870, Internat. J. Game Theory 6 (1977), 11-22. MR0456797DOI10.1007/BF01770870
  14. Wal, J. van der, 10.1007/BF00933260, J. Optim. Theory Appl. 25 (1978), 125-138. MR0526244DOI10.1007/BF00933260
  15. White, D. J., 10.1287/inte.15.6.73, Interfaces 15 (1985), 73-83. DOI10.1287/inte.15.6.73
  16. White, D. J., 10.1287/inte.18.5.55, Interfaces 18 (1988), 55-61. DOI10.1287/inte.18.5.55
  17. Zachrisson, L. E., Markov games., In: Advances in Game Theory (M. Dresher, L. S.Shapley and A. W. Tucker, eds.), Princeton Univ. Press, Princeton 1964, pp. 211-253. Zbl0126.36507MR0170729

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.