Dirty war: chemical weapon use and domestic repression

The utilization of chemical weapons to quash domestic rebellion is a drastic action for a regime facing domestic challengers to take, especially given the reputation costs and risk of international intervention. However, recent developments have illustrated that some regimes have contemplated and implemented extraordinary measures (including the use of chemical munitions) to quash rebellion. This study addresses the question of why some states utilize chemical weapons against domestic challengers while others refrain from this level of state repression. I argue that the utilization of chemical weapons has both domestic and international elements. Specifically, that ethnic cleavages that lead to secessionist challenges and factors associated with inter-state rivalry impact the likelihood that a state utilizes the employment of chemical munitions. I test my argument and other explanations regarding repression with a casestudy approach utilizing captured Iraqi Government documents comparing Iraq’s Al-Anfal campaigns with developments during the recent Syrian Civil War.     

Multiobjective flow-shop scheduling

Previous research on the scheduling of multimachine systems has generally focused on the optimization of individual performance measures. This article considers the sequencing of jobs through a multimachine flow shop, where the quality of the resulting schedule is evaluated according to the associated levels of two scheduling criteria, schedule makespan (C_max) and maximum job tardiness (T_max). We present constructive procedures that quantify the trade-off between C_max and T_max. The significance of this trade-off is that the optimal solution for any preference function involving only C_max and T_max must be contained among the set of efficient schedules that comprise the trade-off curve. For the special case of two-machine flow shops, we present an algorithm that identifies the exact set of efficient schedules. Heruistic procedures for approximating the efficient set are also provided for problems involving many jobs or larger flow shops. Computational results are reported for the procedures which indicate that both the number of efficient schedules and the error incurred by heuristically approximating the efficient set are quite small.     

Is human trafficking the dark side of economic freedom?

Economic freedom has increased living standards worldwide. Concurrent with such gains are rising concerns about potential human costs associated with free markets. This paper uses data on human trafficking and anti-trafficking policies, in conjunction with a measure of economic freedom, to examine whether free markets exacerbate or attenuate the incidence of human trafficking and policies designed to combat it. We do not find evidence suggesting that economic freedom is associated with human trafficking. In addition, our results suggest that economically free countries are more likely to enact and enforce policies to fight human trafficking.     

Stepwise inspection in Bayesian multiattribute acceptance sampling

Bayesian models for multiattribute acceptance sampling have been developed under the assumption that sampling inspection is carried to completion. A Bayesian multiattribute model for stepwise sampling inspection is proposed, whereby sampling inspection is terminated as soon as the disposition of the inspection lot is determined. An iterative solution procedure is developed for obtaining optimal or near-optimal multiattribute acceptance sampling plans under stepwise sampling inspection. The effect of stepwise sampling inspection on the characteristics of an optimal sampling plan is investigated. It is shown that stepwise sampling inspection achieves a sampling plan with lower total expected cost than complete sampling inspection. In addition, it is shown that the sequence of attributes in a stepwise sampling inspection substantially affects the sampling plan and resultant expected cost. The proposed methodology is used to evaluate various heuristics which may be used to determine the sequence of attributes in a stepwise inspection procedure.     

A note on optimal pricing for finite capacity queueing systems with multiple customer classes

This article investigates optimal static prices for a finite capacity queueing system serving customers from different classes. We first show that the original multi‐class formulation in which the price for each class is a decision variable can be reformulated as a single dimensional problem with the total load as the decision variable. Using this alternative formulation, we prove an upper bound for the optimal arrival rates for a fairly large class of queueing systems and provide sufficient conditions that ensure the existence of a unique optimal arrival rate vector. We show that these conditions hold for M/M/1/m and M/G/s/s systems and prove structural results on the relationships between the optimal arrival rates and system capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Designing rewards-based crowdfunding campaigns for strategic (but distracted) contributors

In rewards-based crowdfunding, entrepreneurs solicit donations from a large number of individual contributors. If total donations exceed a prespecified funding target, the entrepreneur distributes nonmonetary rewards to contributors; otherwise, their donations are refunded. We study how to design such campaigns when contributors choose not just whether to contribute, but also when to contribute. We show that strategic contribution behavior—when contributors intentionally delay until campaign success is likely—can arise from the combination of nonrefundable (potentially very small) hassle costs and the risk of campaign failure, and can explain pledging patterns commonly observed in crowdfunding. Furthermore, such delays do not hurt the entrepreneur if contributors are perfectly rational, but they do if contributors are distracted, that is, if they might fail to return to the campaign after an intentional delay. To mitigate this, we find that an entrepreneur can use a simple menu of rewards with a fixed number of units sold at a low price, and an unlimited number sold at a higher price; this segments contributors over time based on the information they observe upon arrival. We show that, despite its simplicity, such a menu performs well compared to a theoretically optimal menu consisting of an infinite number of different rewards and price levels under many conditions.     

Operational Combat Analysis of the Al Qaeda Network

Contemporary network organizational structures have gradually developed over the last decades of the twentieth century. These new structures are challenging the traditional hierarchical structure form in a number of venues. In conflict and war, they made their potentials unequivocally known on 11 September 2001 via Al Qaeda's strategic suicide bombings against the United States. To better understand the military potentials of networks, an operational combat analysis of the Al Qaeda network was conducted. This analysis, a modification of weapons systems analysis, focused on network speed, along with offensive, defensive and combat multiplier attributes. Such analysis allows for a better understanding of the military capabilities and vulnerabilities of non-state OPFORs (opposing forces) and our own emergent counter-insurgency networks.     

Duality in constrained multi‐facility location models

We consider the ??_p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??_pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010