Finding the optimal mixed strategy of static spatial search games on connected graphs
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,...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2014
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/18009 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| 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). |
|---|