Optimal search and ambush for a hider who can escape the search region (Q322755)
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: Optimal search and ambush for a hider who can escape the search region |
scientific article; zbMATH DE number 6636170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal search and ambush for a hider who can escape the search region |
scientific article; zbMATH DE number 6636170 |
Statements
Optimal search and ambush for a hider who can escape the search region (English)
0 references
7 October 2016
0 references
game theory
0 references
two-person games
0 references
search games
0 references
search problems
0 references
predator-prey interactions
0 references
0.8483481407165527
0 references
0.8411699533462524
0 references
0.8377955555915833
0 references
0.828799307346344
0 references
0.8215278387069702
0 references
