On some stocxastic tactical antisubmarine games

A. Charnes and R. G. Schroeder

Naval Research Logistics Quarterly, 1967, vol. 14, issue 3, 291-311

Abstract: Mathematical models of tactical problems in Hntisubmarine Warfare (ASW) are developed. Specifically, a game of pursuit between a hunter‐killer force. player 1, and a possible submarine, player 2 is considered. The game consists of a sequence of moves and terminates when player 2 is tcaught or evades player 1. When the players move they observe the actual tactical configuration of the forces (state) and each player choosa‐s a tactical plan from a finite collection. This joint choice of tactical plans determines an immediate payoff and a transition probability distribution over the states. Hence an expected payoff function is defined, Formally this game is a Terminating Stochastic Game (TSG). Shapley demonstrated the existence of a value and optimal strategies (solution), An iterative technique to approximate the solution to within desired accuracy is proposed. Each iteration of the technique is obtained by solving a set of linear programs. To introduce more realism into the game several variations of the TSG are also considered. One variation is a finite TSG and linear programming techniques are employed to find the solution.

Date: 1967
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800140303

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:14:y:1967:i:3:p:291-311

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().