Finding the optimal mixed strategy of static spatial search games on connected graphs
Date of Publication
2014
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
Subject Categories
Physical Sciences and Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
Static Spatial Search Games on graphs is played by two players, the searcher and the concealer, on a connected graph in which both players simultaneously choose a vertex. The searcher wins if he chooses the vertex within the concealer's radius otherwise, the concealer wins. After a single play, the players exchange roles. The main objective of the study is to nd an optimal mixed strategy for the searcher(~p) and the concealer(~q).
Abstract Format
html
Language
English
Format
Electronic
Accession Number
CDTU019206
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Recommended Citation
Piad, M. C. (2014). Finding the optimal mixed strategy of static spatial search games on connected graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/18009
