Drones,spies, terrorists,and second-class citizenship in Pakistan

This essay reviews seven recent books and reports that focus upon the use of US armed drones in Pakistan's Federally Administered Tribal Areas (FATA). This essay synthesizes a historical account of the program, critically interrogates key arguments and evidence advanced by the authors, and draws attention the particular problems that confront those who live in the FATA and the second-class citizenship that the Pakistani state has bestowed upon them for reasons of domestic and foreign policy concerns. This review essay does not intend to be the final word on any of the ongoing policy debates. But it does hope to enable a wider audience to take part in these important deliberations.     

Asymmetric information and third-party intervention in civil wars

I study a two-period model of conflict with two combatants and a third party who is an ally of one of the combatants. The third party is fully informed about the type of her ally but not about the type of her ally’s enemy. In a signaling game, I find that if the third party is unable to give a sufficiently high assistance to her ally, then there exists a unique separating equilibrium in which the third party’s expected intervention causes her ally’s enemy to exert more effort than in the absence of third-party intervention; this worsens the conflict.     

The evolving menace of baby factories and trafficking in Nigeria

Trafficking in persons in Nigeria has largely targeted adults and children, particularly women and girls. Of growing concern, however, is the recent emergence and growth of sophisticated and syndicated groups involved in baby ‘factories’ and trafficking in Nigeria. This article examines the nature, actors, modus operandi and motives behind this emergent dimension of human trafficking in Nigeria. It concludes that if concerted efforts are not made to deal with the actors and dismantle the market, its profitability will embolden current actors and even encourage new entrants into the booming trade – now and in the future.     

Strategic “defensivism” and post-reset blues: US–Russian nuclear arms reductions,missile defenses and minimum deterrence

US nuclear deterrence and arms control policy may be moving, by design and by inadvertence, toward a posture of strategic “defensivism”. Strategic “defensivism” emphasizes the overlapping and reinforcing impact of: (1) reductions in US, Russian and possibly other strategic nuclear forces, possibly down to the level of “minimum deterrence,” (2) deployment of improved strategic and/or theater antimissile defenses for the US, NATO allies and other partners; and (3) additional reliance on conventional military forces for some missions hitherto preferentially assigned to nuclear weapons. This article deals with the first two of these aspects only: the interaction between missile defenses and offensive force reductions in US–Russian strategy and policy. The findings are that stable deterrence as between the USA and Russia is possible at lower than New Strategic Arms Reduction Treaty levels, but reductions below 1000 deployed long-range weapons for each state, toward a true minimum deterrent posture, will require multilateral as opposed to bilateral coordination of arms limitations. Missile defenses might provide some denial capability against light attacks by states with small arsenals, but they still fall short of meaningful damage limitation as between powers capable of massive nuclear strikes.     

Exact algorithms for integrated facility location and production planning problems

We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

On optimal system designs in reliability‐economics frameworks

Reliability Economics is a field that can be defined as the collection of all problems in which there is tension between the performance of systems of interest and their cost. Given such a problem, the aim is to resolve the tension through an optimization process that identifies the system which maximizes some appropriate criterion function (e.g. expected lifetime per unit cost). In this paper, we focus on coherent systems of n independent and identically distributed (iid) components and mixtures thereof, and characterize both a system's performance and cost as functions of the system's signature vector (Samaniego, IEEE Trans Reliabil (1985) 69–72). For a given family of criterion functions, a variety of optimality results are obtained for systems of arbitrary order n. Approximations are developed and justified when the underlying component distribution is unknown. Assuming the availability of an auxiliary sample of N component failure times, the asymptotic theory of L‐estimators is adapted for the purpose of establishing the consistency and asymptotic normality of the proposed estimators of the expected ordered failure times of the n components of the systems under study. These results lead to the identification of ε‐optimal systems relative to the chosen criterion function. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007