Index Policies for Shooting Problems

DOI10.1287/OPRE.1070.0444MaRDI QIDQ3392111zbMATH OpenOpenAlexFDO

Authors

Publication date 13 August 2009

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/58fbb2054db0cc7247ab238e7b0012c4a9d11c70

Mathematics Subject Classification ID

Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 194374
• The Multi-Armed Bandit Problem: Decomposition and Computation
• On the Gittins index for multiarmed bandits
• Indexability and optimal index policies for a class of reinitialising restless bandits
• Index policies for discounted bandit problems with availability constraints

Cited in

(5)

• Bi-objective dynamic weapon-target assignment problem with stability measure
• Suppression of enemy air defenses (SEAD) as an information duel
• Multi-armed bandits under general depreciation and commitment
• Optimal activation of halting multi‐armed bandit models
• A sequential partial information bomber‐defender shooting problem

This page was built for publication: Index Policies for Shooting Problems

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