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 |
| Summary: | 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. |
|---|