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 |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-18522 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-185222022-01-05T06:21:33Z Finding the optimal mixed strategy of static spatial search games on connected graphs Piad, Marco Angelo C. 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). 2014-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/18009 Bachelor's Theses English Animo Repository Physical Sciences and Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Physical Sciences and Mathematics |
| spellingShingle |
Physical Sciences and Mathematics Piad, Marco Angelo C. Finding the optimal mixed strategy of static spatial search games on connected graphs |
| description |
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). |
| format |
text |
| author |
Piad, Marco Angelo C. |
| author_facet |
Piad, Marco Angelo C. |
| author_sort |
Piad, Marco Angelo C. |
| title |
Finding the optimal mixed strategy of static spatial search games on connected graphs |
| title_short |
Finding the optimal mixed strategy of static spatial search games on connected graphs |
| title_full |
Finding the optimal mixed strategy of static spatial search games on connected graphs |
| title_fullStr |
Finding the optimal mixed strategy of static spatial search games on connected graphs |
| title_full_unstemmed |
Finding the optimal mixed strategy of static spatial search games on connected graphs |
| title_sort |
finding the optimal mixed strategy of static spatial search games on connected graphs |
| publisher |
Animo Repository |
| publishDate |
2014 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/18009 |
| _version_ |
1772835112040267776 |