A Game Theoretic Approach to Convoy Routing
Abstract
A two-person search / ambush game is considered where each player wants to maximize his survival time while minimizing the survival time of his adversary. This is done in the context of convoy routing where each player can choose which route they take. Their estimated survival times depend upon (a) if their adversary is directly searching on that route, (b) the indirect probability of detection or hazard if their adversary is not along that route, and (c) the risk involved with moving from route to route. It is possible for a player to be interdicted even if his adversary is not on that route. Each player has a payoff matrix that maximizes their expected time to capture. We show that both payoff matrices can be evaluated as a bimatrix game that yields optimal mixed Nash Equilibria through the use of non-linear programming. The results of this evaluation can be used to optimally conduct route clearing and convoy routing.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 2009
- Accession Number
- ADA501737
Entities
People
- William T. Smith
Organizations
- Naval Postgraduate School