Abstract
In this chapter we consider a basic notion of game theory: a class of games called finite perfect information games. First (section 11.1) we consider some examples that illustrate the notion of a winning strategy. Then in section 11.2 we prove the Zermelo theorem and define the notion of game cost. This leads to an algorithmic question: how can we compute the game cost? In section 11.3 we show an algorithm based on the full traversal of the game tree, and in section 11.4 we study an optimization technique that allows us to compute (exactly) the game cost avoiding some parts of the game tree. Finally, in section 11.5 we apply dynamic programming to gameanalysis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Shen, A. (2010). Games analysis. In: Algorithms and Programming. Springer Undergraduate Texts in Mathematics and Technology. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-1748-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1748-5_11
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-1747-8
Online ISBN: 978-1-4419-1748-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)