Abstract
Let us assume that the plan of a town can be viewed as a quadratic matrix. The rows and columns represent the streets, the elements of the matrix symbolize the buildings. In one of the buildings a bomb has been hidden. We have enough time to search through only one street. If the bomb has been placed in the street we are searching through, then we shall surely find it and get a pay-off equivalent to what the building to be blown up is worth. In case we cannot detect the bomb our pay-off is zero. What are the optimal strategies of both players, i.e., the “Seeker” and the “Hider”, provided the value of each building is positive?
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Akadémiai Kiadó, Budapest, Hungary
About this chapter
Cite this chapter
Szép, J., Forgó, F. (1985). Examples of matrix games. In: Introduction to the Theory of Games. Mathematics and Its Applications, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5193-8_15
Download citation
DOI: https://doi.org/10.1007/978-94-009-5193-8_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-8796-4
Online ISBN: 978-94-009-5193-8
eBook Packages: Springer Book Archive