Lanchester Model for Three-Way Combat
Caulkins, Jonathan P.
MetadataShow full item record
Lanchester (1916) modeled combat situations between two opponents, where mutual attrition occurs continuously in time, by a pair of simple ordinary (linear) differential equations. The aim of the present paper is to extend the model to a conflict consisting of three parties. In particular, Lanchester's main result, i.e. his square law, is adapted to a triple fight. However, here a central factor besides the initial strengths of the forces determining the long run outcome is the allocation of each opponent's efforts between the other two parties. De- pending on initial strengths, (the) solution paths are calculated and visualized in appropriate phase portraits. We are able identify regions in the state space where, independent of the force allocation of the opponents, always the same combatant wins, regions, where a combatant can win if its force allocation is wisely chosen, and regions where a combatant cannot win itself but determine the winner by its forces allocation. As such, the present model can be seen as a forerunner of a dynamic game between three opponents.
Showing items related by title, author, creator and subject.
Rorer, James L.; Asifuinagomez, Luis F. (Monterey, California: Naval Postgraduate School, 2013-12);In this research project, we provide a method in which we incorporated a nonlinear model to allocate consolidated automated support system (CASS) stations utilizing real demand. In reviewing available literature, we frame ...
Allocating overhead costs in a Navy Working Capital Fund environment : an analysis and comparison of current Navy policy and private sector practice Schulte, Steven H. (Monterey, California: Naval Postgraduate School, 1999-06);This thesis was developed in response to Naval Air Warfare Aircraft Division (NAWCAD) management's desire to explore alternative overhead allocation practices in order to better understand their organization's cost ...
Falcao, Marco A. G. (Monterey, California. Naval Postgraduate School, 1992-09);Task allocation is an important component of the process of mapping modules of application programs to multicomputers. A scheme for static allocation of periodic tasks with precedences to processors is developed considering ...