A sequential partial information bomber‐defender shooting problem

DOI10.1002/NAV.21892MaRDI QIDQ6093551zbMATH OpenOpenAlexFDO

Authors Kalyanam Krishnamoorthy, David W. Casbeer, Meir Pachter

Publication date 9 October 2023

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

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

zbMATH Keywords

attacker-defender gamepartial informationsequential decision makingshoot-look-shoot

Mathematics Subject Classification ID

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

Recommendations

• Some results on the bomber problem
• scientific article; zbMATH DE number 1084192
• Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset
• Optimal sequential allocation with imperfect feedback information
• Index Policies for Shooting Problems

Cites work

• 41 counterexamples to property (B) of the discrete time bomber problem
• 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
• ABCs of the bomber problem and its relatives
• Decision rules for attacking targets of opportunity
• On Optimal Ammunition Usage When Hunting Fleeing Targets
• On the structural properties of a discrete-time single product revenue management problem
• Suboptimal decision rule for attacking targets of opportunity

Cited in

(2)

• scientific article; zbMATH DE number 1084192 (Why is no real title available?)
• A review of attacker-defender games: current state and paths forward

This page was built for publication: A sequential partial information bomber‐defender shooting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093551)