RAISING THE COST OF REBELLION: THE ROLE OF THIRD‐PARTY INTERVENTION IN INTRASTATE CONFLICT

This paper presents a simple model to characterize explicitly the role that an intervening third party plays in raising the cost of rebellion in an intrastate conflict. Extending the Gershenson‐Grossman (2000 Gershenson, D. and Grossman, H.I. 2000. Civil conflict: ended or never ending?. Journal of Conflict Resolution, 44(6): 807–821.  [Google Scholar]) framework of conflict in a two‐stage game to the case involving outside intervention in a three‐stage game as in Chang et al. (2007b Chang, Y.‐M., Potter, J. and Sanders, S. 2007b. War and peace: third‐party intervention in conflict. European Journal of Political Economy, 23(4): 954–974.  [Google Scholar]), we examine the conditions under which an outside party optimally intervenes such that (i) the strength of the rebel group is diminished or (ii) the rebellion is deterred altogether. We also find conditions in which a third party optimally intervenes but at a level insufficient to deter rebellion. Such behavior, which improves the incumbent government’s potential to succeed in conflict, is overlooked in some conflict studies evaluating the effectiveness of intervention. One policy implication of the model is that an increase in the strength of inter‐governmental trade partnerships increases the likelihood that third‐party intervention deters rebellion.     

ARMY RE‐ENLISTMENT DURING OIF/OEF: BONUSES,DEPLOYMENT, AND STOP‐LOSS

In 2004, stretched by wartime deployments, the US Army countered declining retention by increasing re‐enlistment bonuses and implementing stop‐loss to prevent soldiers from separating at the end of their enlistment. We estimate the effects of bonuses, deployment, and stop‐loss on re‐enlistment between FY 2002 and 2006. We estimate that the baseline propensity to re‐enlist fell by 20%. However, we find that deployed soldiers are more likely to re‐enlist and that the estimated effects of re‐enlistment bonuses are similar to those estimated in peacetime. We evaluate the reasons for our findings, and calculate the cost effectiveness of re‐enlistment bonuses.     

AGENDA FOR DEFENSE AND PEACE ECONOMICS

This brief introduction celebrates the 20th Anniversary of the Journal, Defence and Peace Economics. Suggesting elements of an agenda for the future of this branch of economics, I raise several topics that are new and that seem to indicate that the field will expand and shift focus substantially in future years.     

CONFLICT RESOLUTION PROCESSES,UNCERTAINTY AND INVESTMENT DYNAMICS: EVIDENCE FOR THE BASQUE COUNTRY

The Junior Reserve Officers’ Training Corps is a high school program that combines classroom teaching with extracurricular activities. The program is located primarily in inner city schools and serves at‐risk students. Its goals are multidimensional and include military preparation and improving academic achievement. Using High School and Beyond data we find that the program’s effects depend on the timing and intensity of involvement. Test scores, graduation rates, and enlistments are higher for students who participate early in high school and for those who persist in the program. Conversely, we find few effects for students participating in the last two years of high school.     

Military expenditure and employment in South Africa*

Previous research into the impact of military expenditure on employment finds considerable variation across countries. This paper adds to the debate by examining the long run relationship between military burden and manufacturing employment in South Africa. Such an analysis provides an opportunity to test for crowding‐out effects and the impact of the marked decline in military spending on the South African economy. The paper finds evidence supporting the view that military expenditure will have a detrimental impact on long term manufacturing employment, adversely affecting industrial structure and efficiency.     

二阶阶跃模型下导航信号畸变对接收机载噪比估计影响分析

载噪比作为评估导航信号质量的重要指标,直接影响着接收机的捕获、跟踪和电文解调性能。推导了基于国际民航组织二阶阶跃信号畸变模型下导航接收机采用相关、非相关处理时载噪比估计与畸变模型参数之间的解析表达式,并分析了畸变参数对导航接收机载噪比估计误差的影响。理论分析及仿真结果表明:数字畸变参数变化范围下导航信号载噪比变化在10-2量级,增大模拟畸变的振荡频率或者减小衰减频率将会提高载噪比估计值,模拟畸变参数变化引起的载噪比损耗可达0.1d BHz,畸变参数对载噪比估计的影响整体上都较小,因此导航接收机的载噪比输出不能作为监测导航信号是否异常的完备检测量。     

A mathematical formulation and efficient heuristics for the dynamic container relocation problem

The container relocation problem (CRP) is concerned with emptying a single yard‐bay which contains J containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. The CRP can be modeled as a binary integer programming (IP) problem and is known to be NP‐hard. In this work, we focus on an extension of the CRP to the case where containers are both received and retrieved from a single yard‐bay, and call it the dynamic container relocation problem. The arrival (departure) sequences of containers to (from) the yard‐bay is assumed to be known a priori. A binary IP formulation is presented for the problem. Then, we propose three types of heuristic methods: index based heuristics, heuristics using the binary IP formulation, and a beam search heuristic. Computational experiments are performed on an extensive set of randomly generated test instances. Our results show that beam search heuristic is very efficient and performs better than the other heuristic methods.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 101–118, 2014     

Bicriteria multiresource generalized assignment problem

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014     

Improved bounds for batch scheduling with nonidentical job sizes

Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on single and parallel identical machines, with the objective of minimizing the makespan. For the single machine case, we present an algorithm which calls an online algorithm (chosen arbitrarily) for the one‐dimensional bin‐packing problem as a sub‐procedure, and prove that its worst‐case ratio is the same as the absolute performance ratio of . Hence, there exists an algorithm with worst‐case ratio , which is better than any known upper bound on this problem. For the parallel machines case, we prove that there does not exist any polynomial‐time algorithm with worst‐case ratio smaller than 2 unless P = NP, even if all jobs have unit processing time. Then we present an algorithm with worst‐case ratio arbitrarily close to 2. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 351–358, 2014