TY - JOUR
AU - Washburn, Alan R.
AB - Cumulative search‐evasion games (CSEGs) are two‐person zero‐sum search‐evasion games where play proceeds throughout some specified period without interim feedback to either of the two players. Each player moves according to a preselected plan. If (Xt, Yt,) are the positions of the two players at time t, then the game's payoff is the sum over t from 1 to T of A(Xt, Yt, t). Additionally, all paths must be “connected.” That is, the finite set of positions available for a player in any time period depends on the position selected by that player in the previous time period. One player attempts to select a mixed strategy over the feasible T‐time period paths to maximize the expected payoff. The other minimizes. Two solution procedures are given. One uses the Brown‐Robinson method of fictitious play and the other linear programming. An example problem is solved using both procedures.
TI - Cumulative search‐evasion games
JF - Naval Research Logistics: An International Journal
DO - 10.1002/1520-6750(199108)38:4<495::AID-NAV3220380405>3.0.CO;2-6
DA - 1991-08-01
UR - https://www.deepdyve.com/lp/wiley/cumulative-search-evasion-games-tEh2TjAxc0
SP - 495
EP - 510
VL - 38
IS - 4
DP - DeepDyve
ER -