A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs (Q1735189): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q128422678, #quickstatements; #temporary_batch_1723667127323 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2019.02.017 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2019.02.017 / rank | |||
Normal rank | |||
Latest revision as of 06:43, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs |
scientific article |
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
