Portal de Periódicos da CAPES

Ambushing Random Walks III: More Continuous Models

1981; Institute for Operations Research and the Management Sciences; Volume: 29; Issue: 1 Linguagem: Inglês

10.1287/opre.29.1.121

1526-5463

William H. Ruckle, John R. Reay,

Optimization and Search Problems

We continue our study of the following game theory problem: a traveler (BLUE) wishes to choose a path across a rectangle from left to right in such a way to avoid certain obstacles in the rectangle (called ambushes) which are chosen by his antagonist (RED). The game theoretic payoff might depend upon whether BLUE's path and the ambushes have a common point, or the payoff may be a function of how far the path proceeds before meeting the first ambush. These ambush games have analogous search games.