Ambushing Random Walks III: More Continuous Models

William H. Ruckle and John R. Reay
Additional contact information
William H. Ruckle: Clemson University, Clemson, South Carolina
John R. Reay: Western Washington University, Bellingham, Washington

Operations Research, 1981, vol. 29, issue 1, 121-129

Abstract: 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.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.1.121 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:29:y:1981:i:1:p:121-129

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().