A gaming analysis of counter-infiltration operations
Approved for public release; distribution is unlimited === An analysis is made of the allocation problem associated with the conduct of ambush operations to interdict infiltration routes in a guerrilla-counterguerrilla environment. A multi-stage two-person non-zero sum game is used to model that al...
Main Author: | |
---|---|
Other Authors: | |
Language: | en_US |
Published: |
Monterey, California; Naval Postgraduate School
2012
|
Online Access: | http://hdl.handle.net/10945/15014 |
id |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-15014 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-150142015-05-16T04:04:21Z A gaming analysis of counter-infiltration operations Riddell, John Marion Lindsay, G. F. Naval Postgraduate School Department of Operations Analysis Approved for public release; distribution is unlimited An analysis is made of the allocation problem associated with the conduct of ambush operations to interdict infiltration routes in a guerrilla-counterguerrilla environment. A multi-stage two-person non-zero sum game is used to model that allocation problem. It is shown that Lanchester's equations can be used to develop a criterion function, related to the casualty ratio, which demonstrates the minimax property. The game is then solved to determine the optimal allocations for both the guerrilla and the counterguerrilla and the value of the game for two different forms of the criterion function. The two results are compared and the usefulness of the casualty ratio as a measure of effectiveness is discussed. 2012-11-01T22:54:54Z 2012-11-01T22:54:54Z 1970-04 Thesis http://hdl.handle.net/10945/15014 en_US This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, it may not be copyrighted Monterey, California; Naval Postgraduate School |
collection |
NDLTD |
language |
en_US |
sources |
NDLTD |
description |
Approved for public release; distribution is unlimited === An analysis is made of the allocation problem associated with the conduct of ambush operations to interdict infiltration routes in a guerrilla-counterguerrilla environment. A multi-stage two-person non-zero sum game is used to model that allocation problem. It is shown that Lanchester's equations can be used to develop a criterion function, related to the casualty ratio, which demonstrates the minimax property. The game is then solved to determine the optimal allocations for both the guerrilla and the counterguerrilla and the value of the game for two different forms of the criterion function. The two results are compared and the usefulness of the casualty ratio as a measure of effectiveness is discussed. |
author2 |
Lindsay, G. F. |
author_facet |
Lindsay, G. F. Riddell, John Marion |
author |
Riddell, John Marion |
spellingShingle |
Riddell, John Marion A gaming analysis of counter-infiltration operations |
author_sort |
Riddell, John Marion |
title |
A gaming analysis of counter-infiltration operations |
title_short |
A gaming analysis of counter-infiltration operations |
title_full |
A gaming analysis of counter-infiltration operations |
title_fullStr |
A gaming analysis of counter-infiltration operations |
title_full_unstemmed |
A gaming analysis of counter-infiltration operations |
title_sort |
gaming analysis of counter-infiltration operations |
publisher |
Monterey, California; Naval Postgraduate School |
publishDate |
2012 |
url |
http://hdl.handle.net/10945/15014 |
work_keys_str_mv |
AT riddelljohnmarion agaminganalysisofcounterinfiltrationoperations AT riddelljohnmarion gaminganalysisofcounterinfiltrationoperations |
_version_ |
1716803770206126080 |