A sequential partial information bomber‐defender shooting problem

DOI10.1002/nav.21892OpenAlexW3008241964MaRDI QIDQ6093551

David Wellman Casbeer, Unnamed Author, Meir Pachter

Publication date: 9 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21892

zbMATH Keywords

partial informationsequential decision makingattacker-defender gameshoot-look-shoot

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Games with incomplete information, Bayesian games (91A27)

Cites Work

• ABCs of the bomber problem and its relatives
• 41 counterexamples to property (B) of the discrete time bomber problem
• On the structural properties of a discrete-time single product revenue management problem
• Suboptimal decision rule for attacking targets of opportunity
• A SEQUENTIAL ALLOCATION GAME FOR TARGETS WITH VARYING VALUES
• A SEQUENTIAL ALLOCATION PROBLEM WITH SEARCH COST WHERE THE SHOOT-LOOK -SHOOT POLICY IS EMPLOYED
• A STOCHASTIC SEQUENTIAL ALLOCATION PROBLEM WHERE THE RESOURCES CAN BE REPLENISHED
• Decision rules for attacking targets of opportunity
• On Optimal Ammunition Usage When Hunting Fleeing Targets