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:
書目詳細資料
主要作者: Piad, Marco Angelo C.
格式: text
語言:English
出版: Animo Repository 2014
主題:
在線閱讀:https://animorepository.dlsu.edu.ph/etd_bachelors/18009
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!