Abstract
In this paper, we present some recent results of infinite games played on a finite graph. We mainly work with generalized reachability games and Büchi games. These games are two-player concurrent games in which each player chooses simultaneously their moves at each step. We concern here with a description of winning strategies and payoff functions over infinite plays. Each play and the outcome of a game are completely determined by strategies of the players. We classify strategies regarding their use of history. Our goal is to give simple expressions of values for each game. Moreover, we are interested in the question of what type of optimal (ε-optimal) strategy exists for both players depending on the type of games.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Blackwell, D.: Infinite G δ games with imperfect information. In: Zastosowania Matematyki Applicationes Mathematicae, Hugo Steinhaus Jubilee Volume, pp. 99–101 (1969)
Chatterjee, K., Randour, M., Raskin, J.-F.: Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 115–131. Springer, Heidelberg (2012)
Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean-payoff parity games. In: Proc. of LICS, pp. 178–187. IEEE Computer Society (2005)
Chatterjee, K., Doyen, L., Singh, R.: On memoryless quantitative objectives. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 148–159. Springer, Heidelberg (2011)
Chatterjee, K., de Alfaro, L., Henzinger, T.A.: Strategy improvement for concurrent reachability games. In: Proc. of Third International Conference on the Quantitative Evaluation of Systems QEST (2006)
De Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1022–1037. Springer, Heidelberg (2003)
De Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. Journal of Computer and System Sciences 68, 374–397 (2004)
Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. Journal of Game Theory 8(2), 109–113 (1979)
Filar, J., Vrieze, K.: Competitive Markov decision processes. Springer, Heidelberg (1997)
Gale, D., Stewart, F.M.: Infinite games with perfect information. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games. Annals of Mathematics Studies, vol. 2(28), pp. 245–266. Princeton University Press, Princeton (1953)
Krcǎl, J.: Determinacy and optimal strategies in stochastic games. Master’s Thesis, Faculty of Informatics, Masaryk University (2009)
Kučera, A.: Turn-based stochastic games. In: Apt, K.R., Grädel, E. (eds.) Lectures in Game Theory for Computer Scientists, pp. 146–184. Cambridge University Press, Cambridge (2011)
Martin, D.A.: The determinacy of Blackwell games. Journal Symbolic Logic 63(4), 1565–1581 (1998)
Martin, D.A.: Borel determinacy. Annals of Mathematics 102, 363–371 (1975)
Von Neumann, J.: Zur Theorie der Gesellschaftsspiele. Math. Annalen 100, 295–320 (1928)
Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theoretical Computer Science 158, 343–359 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ghani, A.T.A., Higuchi, K. (2014). On Values of Games. In: Tantar, AA., et al. EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V. Advances in Intelligent Systems and Computing, vol 288. Springer, Cham. https://doi.org/10.1007/978-3-319-07494-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-07494-8_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07493-1
Online ISBN: 978-3-319-07494-8
eBook Packages: EngineeringEngineering (R0)