Cumulative Search-Evasion Games (CSEGs)

Abstract

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. Keywords: Search strategies; Prohibiting; Mathematical models.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1989
Accession Number
ADA207571

Entities

People

  • Alan R. Washburn
  • James N. Eagle

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Air Platforms
  • Autonomy
  • Counter IED

DTIC Thesaurus Topics

  • Computer Programming
  • Computers
  • Feedback
  • Game Theory
  • Industrial Engineering
  • Linear Programming
  • Mainframe Computers
  • Mathematical Models
  • Mathematics
  • Matrix Games
  • New York
  • Operations Research
  • Probability
  • Probability Distributions
  • Search Theory
  • Tactical Training
  • Zero-Sum Games

Readers

  • Game Theory.
  • Regression Analysis.