A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs (Q1735189)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs |
scientific article; zbMATH DE number 7043902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs |
scientific article; zbMATH DE number 7043902 |
Statements
A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs (English)
0 references
28 March 2019
0 references
game theory
0 references
Stackelberg games
0 references
MCTS
0 references
security games
0 references
0 references
0 references
0.7798608541488647
0 references
0.7732640504837036
0 references
0.7607808113098145
0 references
0.7529478073120117
0 references
