Robbert Fokkink
Mathematics Department, TU Delft, NL
Ambush frequency should decrease over time during optimal predator search for prey
[When and where]
We apply the mathematical theory of search games to model the problem faced by a predator searching for prey as a two-player win-lose game. The predator has two strategies - cruising search and ambush – and the prey has two strategies as well – run or hide. If the prey runs, it will get away if the predator is searching but it will be caught if the predator is ambushing. As time progresses, the predator will have searched a larger portion of the space and the prey will be pressed to run. However, time runs out for the predator and if the prey is not caught in time, then the predator gives up and the prey gets away. In an earlier study, we considered this game without the time limitation for the predator, and we showed that ambush frequency increases with time (Alpern, Fokkink, Timmer, Casas, 2011). If we impose the time limitation, then the behaviour of the predator changes drastically and ambush frequency decreases with time. This is joint work with Steve Alpern.
Invited talk Mini-symposium 3 Search problems in predator-prey interactions.
Updated May 12, 2015, by Minus