Allocating capacity in parallel queues to improve their resilience to deliberate attack

DOI10.1002/nav.20478zbMath1241.90029OpenAlexW2139864737MaRDI QIDQ2892133

W. Matthew Carlyle, Roberto Szechtman, Shane G. Henderson

Publication date: 18 June 2012

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.946.4250

zbMATH Keywords

queueing theorysequential gameattacker defender problems

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Decision theory for games (91A35)

Cites Work

• Nature plays with dice - terrorists do not: Allocating resources to counter strategic versus probabilistic risks
• The slow server problem for uninformed customers
• Balancing Terrorism and Natural Disasters—Defensive Strategy with Endogenous Attacker Effort
• The slow server problem
• The flow deviation method: An approach to store‐and‐forward communication network design
• Unnamed Item
• Unnamed Item

This page was built for publication: Allocating capacity in parallel queues to improve their resilience to deliberate attack