IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v61y2014i1p56-65.html
   My bibliography  Save this article

New results on a stochastic duel game with each force consisting of heterogeneous units

Author

Listed:
  • Kyle Y. Lin

Abstract

Two forces engage in a duel, with each force initially consisting of several heterogeneous units. Each unit can be assigned to fire at any opposing unit, but the kill rate depends on the assignment. As the duel proceeds, each force—knowing which units are still alive in real time—decides dynamically how to assign its fire, in order to maximize the probability of wiping out the opposing force before getting wiped out. It has been shown in the literature that an optimal pure strategy exists for this two‐person zero‐sum game, but computing the optimal strategy remained cumbersome because of the game's huge payoff matrix. This article gives an iterative algorithm to compute the optimal strategy without having to enumerate the entire payoff matrix, and offers some insights into the special case, where one force has only one unit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 56–65, 2014

Suggested Citation

  • Kyle Y. Lin, 2014. "New results on a stochastic duel game with each force consisting of heterogeneous units," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 56-65, February.
    • Handle: RePEc:wly:navres:v:61:y:2014:i:1:p:56-65
    DOI: 10.1002/nav.21566
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21566
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21566?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Kensaku Kikuta, 1986. "The matrix game derived from the many‐against‐many battle," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(4), pages 603-612, November.
    2. Richard H. Brown, 1963. "Theory of Combat: The Probability of Winning," Operations Research, INFORMS, vol. 11(3), pages 418-425, June.
    3. M Kress & I Talmor, 1999. "A new look at the 3:1 rule of combat through Markov Stochastic Lanchester models," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(7), pages 733-744, July.
    4. Kensaku Kikuta, 1983. "Technical Note—A Note on the One Against Many Battle," Operations Research, INFORMS, vol. 31(5), pages 952-956, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ken R. McNaught, 2002. "Markovian models of three‐on‐one combat involving a hidden defender," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(7), pages 627-646, October.
    2. Pettit, L. I. & Wiper, M. P. & Young, K. D. S., 2003. "Bayesian inference for some Lanchester combat laws," European Journal of Operational Research, Elsevier, vol. 148(1), pages 152-165, July.
    3. Chad W. Seagren & Donald P. Gaver & Patricia A. Jacobs, 2019. "A stochastic air combat logistics decision model for Blue versus Red opposition," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(8), pages 663-674, December.
    4. Hwang, Sung-Ha, 2012. "Technology of military conflict, military spending, and war," Journal of Public Economics, Elsevier, vol. 96(1), pages 226-236.
    5. Liu, Liwei & Yu, Jun & Guo, Zhi, 2006. "A kind of stochastic duel model for guerrilla war," European Journal of Operational Research, Elsevier, vol. 171(2), pages 430-438, June.
    6. C. J. Ancker & A. V. Gafarian, 1987. "The validity of assumptions underlying current uses of Lanchester attrition rates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(4), pages 505-533, August.
    7. Brian L. Morgan & Harrison C. Schramm & Jerry R. Smith, Jr. & Thomas W. Lucas & Mary L. McDonald & Paul J. Sánchez & Susan M. Sanchez & Stephen C. Upton, 2018. "Improving U.S. Navy Campaign Analyses with Big Data," Interfaces, INFORMS, vol. 48(2), pages 130-146, April.
    8. Michael J. Armstrong, 2005. "A Stochastic Salvo Model for Naval Surface Combat," Operations Research, INFORMS, vol. 53(5), pages 830-841, October.
    9. Kress, Moshe & Caulkins, Jonathan P. & Feichtinger, Gustav & Grass, Dieter & Seidl, Andrea, 2018. "Lanchester model for three-way combat," European Journal of Operational Research, Elsevier, vol. 264(1), pages 46-54.
    10. Michael P. Atkinson & Moshe Kress & Niall J. MacKay, 2021. "Targeting, Deployment, and Loss-Tolerance in Lanchester Engagements," Operations Research, INFORMS, vol. 69(1), pages 71-81, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:61:y:2014:i:1:p:56-65. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.