An Optimal Hostage Rescue Problem where the Probability of a Given Number or More Hostages Being Killed is Minimized

Fengbo Shi (), Mong Shan Ee () and Seizo Ikuta ()
Additional contact information
Fengbo Shi: School of Business, Sun Yat Sen University
Mong Shan Ee: Nottingham University Business School - Malaysia Campus, http://www.nottingham.edu.my/nubs/
Seizo Ikuta: University of Tsukuba

No 2008-11, NUBS Malaysia Campus Research Paper Series from Nottingham University Business School Malaysia Campus

Abstract: This paper proposes a mathematical model for an optimal hostages rescue problem. When more than one person is taken hostage at a given time, a decision as to whether or not to attempt a rescue has to be made. The objective is to minimize the probability of a given number or more hostages being killed where the given number is determined by the decision maker in charge of resolving the crisis. Several properties of the optimal rescue rule are clarified.

Keywords: Dynamic programming; Stochastic processes; Hostage rescue (search for similar items in EconPapers)
Date: 2008-10
References: Add references at CitEc
Citations:

Downloads: (external link)
http://ssrn.com/abstract=1280084

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nom:nubsmc:2008-11

Ordering information: This working paper can be ordered from

Access Statistics for this paper

More papers in NUBS Malaysia Campus Research Paper Series from Nottingham University Business School Malaysia Campus Contact information at EDIRC.
Bibliographic data for series maintained by Rasyad A. Parinduri ().