Security sector stabilisation in counterinsurgency operations: the case of Afghanistan

This article argues that the debate on security sector reform (SSR) needs to be taken further by taking into consideration the fact that, even though the SSR concept was not originally developed as an element in stabilising states undergoing an insurgency, it is very much being used for exactly that. When conducting counterinsurgency with a focus on the creation of stability, the baseline will ultimately have to be security sector stabilisation (SSS) as a precondition for complete SSR implementation. However, the two must be connected to avoid them undermining each other. This is important if a comprehensive approach to programme implementation and especially sustainability is to guide the programme, and not just isolated ‘train and equip’ stand-alone projects that do not solve either the initial need for stabilisation or the long-term need for accountable security forces. Currently, in Afghanistan the surge for security by the international military is in danger of overtaking the other elements of the SSR, thereby undermining the primary end state and thus risking laying the wrong foundation for the long-term process of SSR.     

Book reviews

John Lawrence Tone, The Fatal Knot: The Guerrilla War in Navarre and the Defeat of Napoleon in Spain. Chapel Hill and London; The University of North Carolina Press 1994. Pp.vii + 239, 1 map, biblio., index. $34.95 (cloth). ISBN 0–8078–2169–1.

Robert Holland (ed), Emergencies and Disorder in the European Empires after 1945. London: Frank Cass, 1994. Pp.x + 256; index. £32 (cloth); £15 (paper). ISBN 0–7146–4516–8 and 4109 X

Deborah L. Norden, Military Rebellion in Argentina: Between Coups and Consolidation. Lincoln, NE: University of Nebraska Press, 1996. Pp.242, index, $35/$17.50 (paper). ISBN 0–8032–8369–5.

William M. Minter, Apartheid's Contras: An Inquiry into the Roots of War in Angola and Mozambique. London and Atlantic Highlands, NJ: Zed Books Ltd; Johannesburg: Witwatersrand University Press, 1994. Pp. xii +308, 3 maps, biblio., index. $69.95/£39.95 (cloth); $29.95/£16.95(paper). ISBN 1–85649–266–4 and 266–4.     

One size does not fit all: personalized incentives in military compensation

A critical element in implementing a compensation scheme including nonmonetary incentives (NMIs) is recognizing that preferences vary widely across Service members. There are at least three sources of variability: across different population classes, across individuals within a population class, and across NMI packages for a particular individual. Surveys across different military communities, ranks, and years of Service show the difficulty of identifying any NMI that has significant value for even 50% of the active duty force. At the same time, approximately 80% of the surveyed Service members expressed a significant positive value for at least one NMI. Therefore, one-size-fits-all incentive packages will not be nearly as effective as more personalized incentive packages. The authors discuss variability in Service member NMI preferences and outline an approach to implementing personalized NMI packages in military compensation through a sealed-bid reverse auction, where Service members select individual NMIs from a “cafeteria-style” menu of options.     

Warranty design under buyer and seller risk aversion

This paper provides a framework in which warranty policies for non-repairable items can be evaluated according to risk preferences of both buyers and sellers. In particular, a warranty price schedule is established such that sellers are indifferent among the policies. Given this schedule, a buyer's response is expressed by selecting the price-warranty combination that minimizes disutility. Within this framework, a warranty can be viewed as an instrumet of risk management that can induce more sales and greater profitability. For given utility functions, analytical results for the development of a price schedule are developed. Numerical results illustrate the substitution effects between warranty terms, prices, and risk parameters.     

A lagrangean relaxation algorithm for the constrained matrix problem

We present variants of a convergent Lagrangean relaxation algorithm for minimizing a strictly convex separable quadratic function over a transportation polytope. The algorithm alternately solves two “subproblems,” each of which has an objective function that is defined by using Lagrange multipliers derived from the other. Motivated by the natural separation of the subproblems into independent and very easily solved “subsubproblems,” the algorithm can be interpreted as the cyclic coordinate ascent method applied to the dual problem. We exhibit our computational results for different implementations of the algorithm applied to a set of large constrained matrix problems.