A game theory approach to logistics allocation

A simple model containing elements common to all logistics pipeline allocations is presented. This model is based on a two-sided game.     

Analysis of the dispute over Taiwan using a game theory approach

Throughout the world, there is a large number of young, and even not-so-young, scholars who are reading for higher degrees in strategic, security and defense studies, or engaged in analytical research in research institutes, think-tanks or consultancies; they bring to the subject innovative and fresh perspectives often ignored or missed by more established scholars. Most of these people have yet to make their mark in the defense and security field. The Editors of Defense & Security Analysis are resolved to tap this valuable source of information, observation, analysis and critical study by offering a new section of the journal for their views to be given an opportunity to be aired. Submissions of up to 3,000 words are encouraged from University Master's and Doctoral candidates and post-doctoral researchers.     

A cooperative game in search theory

Search theory originates from the military research efforts of WWII. Most researchers of that period modeled their search games in noncooperative games, where players are enemies or compete against each other. In this article, we deal with a cooperative search game, where multiple searchers behave cooperatively. First we describe several search problems and discuss the possibility of a coalition or cooperation among searchers. For the cooperative search game, we define a function named quasi‐characteristic function, which gives us a criterion similar to the so‐called characteristic function in the general coalition game with transferable utility. The search operation includes a kind of randomness with respect to whether the searchers can detect a target and get the value of the target. We also propose a methodology to divide the obtained target value among members of the coalition taking account of the randomness. As a concrete problem of the cooperative search game, we take the so‐called search allocation game, where searchers distribute their searching resources to detect a target in a cooperative way and the target moves in a search space to evade the searchers. Lastly, we discuss the core of the cooperative search allocation game. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

装备维修器材生产路径决策的两阶启发式算法

当前装备供应保障系统中维修器材存在短缺、积压以及配送系统效率低下等问题,亟须对生产、库存和配送作业环节进行集成优化。为客观反映各个决策环节,将该问题公式化为一个混合整数线性规划模型,针对该模型多变量、多约束的特点,提出了一个基于数学规划的两阶启发式算法对其进行求解。结合算例,检验模型的可行性,并选取求解器CPLEX和一个类似的迭代算法与该算法在求解质量和运算时间方面进行对比与分析。结果表明,提出的模型是合理可行的,该算法在求解不同规模实例时表现出优异的性能。     

A game theoretic approach to a two firm bidding problem

In this paper a model is developed for determining optimal strategies for two competing firms which are about to submit sealed tender bids on K contracts. A contract calls for the winning firm to supply a specific amount of a commodity at the bid price. By the same token, the production of that commodity involves various amounts of N different resources which each firm possesses in limited quantities. It is assumed that the same two firms bid on each contract and that each wants to determine a bidding strategy which will maximize its profits subject to the constraint that the firm must be able to produce the amount of products required to meet the contracts it wins. This bidding model is formulated as a sequence of bimatrix games coupled together by N resource constraints. Since the firms' strategy spaces are intertwined, the usual quadratic programming methods cannot be used to determine equilibrium strategies. In lieu of this a number of theorems are given which partially characterize such strategies. For the single resource problem techniques are developed for determining equilibrium strategies. In the multiple resource problem similar methods yield subequilibrium strategies or strategies that are equilibrium from at least one firm's point of view.     

基于博弈论的装备科研、购置、维修经费比例关系优化分析

通过不同时期国家战略部署、科研发展情况及经济承受能力对装备经费分配的影响分析,采用博弈的方法,建立了装备科研、购置和维修费之间的比例关系优化模型,给出了寻求纳什均衡点的迭代算法,并进行了仿真计算.仿真结果证明了该方法的可行性与正确性.     

一种雷达组网系统抗压制干扰能力的评估方法

将博弈论方法引入到解决雷达组网系统抗压制干扰能力的评估问题中。以雷达组网系统的不同部署方式的集合作为局中人Ⅰ的策略集;干扰机的不同干扰位置的集合作为局中人Ⅱ的策略集,基于鉴别信息的概念,推导了雷达组网系统关于发现目标的平均信息量的度量模型,提出了将纯局势的各单雷达信干比的加权和作为支付矩阵的对应元素。对上述三个要素构成的矩阵博弈进行了仿真分析,结果表明:该方法是可行的。     

Complexity and workload considerations in product mix decisions under the theory of constraints

The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015     

A continuous game of ambush

The article considers a two-person competitive problem in which a traveller wishes to choose a path across a rectangle from left to right in such a way as to avoid being ambushed by his adversary who has placed obstacles within the rectangle. Our results supplement those that have already been obtained by Ruckle and they indicate that, under certain conditions, the players need to adopt rather sophisticated strategies if they are to act optimally. This suggests that a complete solution to the problem could be difficult.     

Solving a selected class of location problems by exploiting problem structure: A decomposition approach

For many combinatorial optimization problems that are NP-hard, a number of special cases exist that can be solved in polynomial time. This paper addresses the issue of solving one such problem, the well-known m-median problem with mutual communication (MMMC), by exploiting polynomially solvable special cases of the problem. For MMMC, a dependency graph is defined that characterizes the structure of the interactions between decision variables. A Lagrangian decomposition scheme is proposed that partitions the problem into two or more subproblems, each having the same structure as the original problem, but with simpler dependency graphs. The dual problems are solved using subgradient or multiplier adjustment methods. An efficient method of adjusting the multiplier values is given. Computational results are reported that show the method to be quite effective. In addition, applications of the approach to other difficult location problems is discussed. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 791–815, 1998     

A remark on the customs and smuggler game

Baston and Bostock formulated a zero-sum game of exhaustion modeling the problem of Customs trying to stop a Smuggler attempting to ship a cargo of perishable contraband across a strait, when Customs has n speedboats for patrolling. Thomas and Nisgav solved this problem for one speedboat. Baston and Bostock investigated it for two speedboats. This article addresses the solution of the three-boat variant of the Customs and Smuggler game. © 1994 John Wiley & Sons, Inc.     

Inventory control under substitutable demand: A stochastic game application

Substitutable product inventory problem is analyzed using the concepts of stochastic game theory. It is assumed that there are two substitutable products that are sold by different retailers and the demand for each product is random. Game theoretic nature of this problem is the result of substitution between products. Since retailers compete for the substitutable demand, ordering decision of each retailer depends on the ordering decision of the other retailer. Under the discounted payoff criterion, this problem is formulated as a two‐person nonzero‐sum stochastic game. In the case of linear ordering cost, it is shown that there exists a Nash equilibrium characterized by a pair of stationary base stock strategies for the infinite horizon problem. This is the unique Nash equilibrium within the class of stationary base stock strategies. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 359–375, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10018     

基于非概率理论的混合不确定性结构可靠性分析方法

摘要: 针对不确定性结构可靠性分析中的输入变量分布参数具有不确定性和输入变量为区间模型的混合不确定性结构展开研究。考虑可用信息最少的情况,将分布参数的不确定性描述为区间模型。通过等概率转换方法将随机变量与其分布参数进行分离,使问题转化为随机与区间变量混合的可靠性问题,建立了混合不确定性问题的可靠性分析模型。基于非概率可靠性理论,建立混合不确定结构分析模型的二级极限状态函数并结合Kriging代理模型建立了高效的求解方法。此外,将所建立的混合不确定模型应用于飞行器结构的不确定性分析中,验证所建模型的合理性和所提方法的高效性和准确性。     

用非概率理论分析混合不确定性结构的可靠性

针对不确定性结构可靠性分析中的输入变量分布参数具有不确定性和输入变量为区间模型的混合不确定性结构展开研究。考虑到可用信息最少的情况,将分布参数的不确定性描述为区间模型。通过等概率转换方法将随机变量与其分布参数进行分离,使问题转化为随机与区间变量混合的可靠性问题,建立了混合不确定性问题的可靠性分析模型。基于非概率可靠性理论,建立混合不确定结构分析模型的二级极限状态函数并结合Kriging代理模型建立了高效的求解方法。将所建立的混合不确定模型应用于飞行器结构的不确定性分析中,验证了所建模型的合理性和所提方法的高效性和准确性。     

Clausewitz and the politics of war: A contemporary theory

ABSTRACT

This paper re-examines the theoretical underpinnings of Strategic Studies, proposing a novel theory and a new framework for analysing war’s fundamental relationship with politics in line with the Clausewitzian tradition. Throughout modern history, Clausewitz’s concept of politics has been misconstrued as referring only to policy whereas in fact, for him, ‘politics’ was a much broader concept, including domestic power struggles. The political logic of war is defined here as the convergence of the interrelating factors of power struggles and policy objectives within a given polity that restrains and enables these political forces. The analysis of the Clausewitzian political logic of war is conducted through the sociological ‘liquid modern’ lens. It is argued that with power increasingly shifting from centralised state-oriented political leadership towards market forces, non-state actors and other political bodies, the effectiveness of war has been reduced. This is evident in the fragmentation of Western political systems and, as a result, suboptimal strategy and the domination of domestic power struggles in political decision-making concerning war.     

Introduction: Exploring the jungle of terminology

When twentieth-century authors wrote about ‘partisan warfare’, they usually meant an insurgency or asymmetric military operations conducted against a superior force by small bands of ideologically driven irregular fighters. By contrast, originally (i.e. before the French Revolution) ‘partisan’ in French, English, and German referred only to the leader of a detachment of special forces (party, partie, Parthey, détachement) which the major European powers used to conduct special operations alongside their regular forces. Such special operations were the classic definition of ‘small war’ (petite guerre) in the late seventeenth and in the eighteenth centuries. The Spanish word ‘la guerrilla’, meaning nothing other than ‘small war’, only acquired an association with rebellion with the Spanish War of Independence against Napoleon. Even after this, however, armies throughout the world have continued to employ special forces. In the late nineteenth century, their operations have still been referred to as prosecuting ‘la guerrilla’ or ‘small war’, which existed side by side with, and was often mixed with, ‘people's war’ or popular uprisings against hated regimes.