A game theoretic approach to convoy routing
Loading...
Authors
Smith, William T.
Subjects
Advisors
Owen, Guillermo
Borges, Carlos
Date of Issue
2009-06
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
Abstract
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.
Type
Thesis
Description
Series/Report No
Department
Applied Mathematics
Organization
Naval Postgraduate School
Identifiers
NPS Report Number
Sponsors
Funder
Format
xvi, 41 p.
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.