The “motivated bias” dilemma in warfare and intelligence

The goal of this article is to challenge the assumption of rationality in the behavior of decision-making units involved in security, defense, intelligence and warfare and to consider the influence of “motivated bias” in such instances. A review of motivational literature within international politics and a discussion of literature applying “motivated biases” to warfare and strategic surprise will offer an alternative view of the primacy of rationality in such decisions.     

Involving the elephant: technical isolation and the role of India in a possible solution to the Iranian nuclear crisis

Apart from North Korea, no state's nuclear program in the twenty-first century has raised more concern to international security than Iran's. While Iran insists that its nuclear program is strictly for civilian purpose in line with Article IV of non-proliferation treaty, the USA and its allies insist that Iran has military intentions and called for sanctions. The failure of sanctions to deter Iran from its nuclear agenda had made many scholars and policy-makers call for a preemptive attack on Iranian nuclear facilities. Situated within this debate, this paper positions itself as an antagonist to the preemptive airstrike option and argues that involving India in a possible nuclear “iron curtain” against Iran – a move known as technical isolation – remains the best option to the current nuclear crises.     

Technical note: Finite-time regret analysis of Kiefer-Wolfowitz stochastic approximation algorithm and nonparametric multi-product dynamic pricing with unknown demand

We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ₁, κ₂ are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature.     

Managerial inventory formulations with stockout objectives and fiscal constraints

Most inventory formulations seek to minimize the sum of ordering costs, holding costs, and stockout costs: however, management often directs inventory policy by specifying a maximum investment level and/or a purchasing budget constraint. Within these limitations, they expect lower level managers to optimize some level of customer satisfaction, such as minimum stockouts or minimum shortages. The author has developed several cases of these “managerial” inventory formulations and has presented some computational results.     

Large deviations of the winsorized mean of an exponential distribution

An asymptotic representation for large deviation probabilities of the Winsorized mean of a sequence of independent, identically distributed exponential random variables is derived. The Winsorized mean, a linear combination of exponential order statistics, is first transformed into a weighted sum of exponential random variables, and then a large deviation theorem for weighted sums can be applied. The representation obtained is then compared with results already known for the mean and the median, the two extreme cases of the Winsorized mean.