The optimal policy for the one-against-many heterogeneous Lanchester model

DOI10.1016/j.orl.2014.08.008zbMath1408.91184OpenAlexW2012879504MaRDI QIDQ1785287

Kyle Y. Lin, Niall J. MacKay

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2014.08.008

zbMATH Keywords

targetingmilitarycombat modelsattrition warfareLanchester's laws

Mathematics Subject Classification ID

Applications of game theory (91A80) History, political science (91F10)

Related Items (5)

A Mathematical Model of Humanitarian Aid Agencies in Attritional Conflict Environments ⋮ Lanchester model for three-way combat ⋮ Asymptotic behavior of positive solutions of a Lanchester-type model ⋮ The Attrition Dynamics of Multilateral War ⋮ Asymptotic properties of solutions of a Lanchester-type model

Cites Work

• Unnamed Item
• Unnamed Item
• The matrix game derived from the many-against-many battle
• Technical Note—A Note on the One Against Many Battle
• Lanchester models for mixed forces with semi-dynamical target allocation
• The Lanchester (n, 1) problem
• An Extension of the Lanchester Square Law to Inhomogeneous Forces with an Application to Force Allocation Methodology
• Technical Note—Optimal Strategy for the One-against-Many Battle
• The Lanchester square-law model extended to a (2,2) conflict
• New results on a stochastic duel game with each force consisting of heterogeneous units

This page was built for publication: The optimal policy for the one-against-many heterogeneous Lanchester model