On nash subsets and mobility chains in bimatrix games

This work is concerned with constructing, analyzing, and finding “mobility chains” for bimatrix games, sequences of equilibrium points along which it is possible for the two players to progress, one equilibrium point at a time, to an equilibrium point that is preferred by both players. The relationship between mobility chains and Nash subsets is established, and some properties of maximal Nash subsets are proved.     

Optimum sequential search with discrete locations and random acceptance errors

Much work has been done in search theory; however, very little effort has occurred where an object's presence at a location can be accepted when no object is present there. The case analyzed is of this type. The number of locations is finite, a single object is stationary at one location, and only one location is observed each step of the search. The object's location has a known prior probability distribution. Also known are the conditional probability of acceptance given the object's absence (small) and the conditional probability of rejection given the object's presence (not too large); these Probabilities remain fixed for all searching and locations. The class of sequential search policies which terminate the search at the first acceptance is assumed. A single two-part optimization criterion is considered. The search sequence is found which (i) minimizes the probability of obtaining n rejections in the first n steps for all n, and (ii) maximizes the probability that the first acceptance occurs within the first n steps and occurs at the object's location for all n. The optimum sequential search policy specifies that the next location observed is one with the largest posterior probability of the object's presence (evaluated after each step from Bayes Rule) and that the object is at the first location where acceptance occurs. Placement at the first acceptance seems appropriate when the conditional probability of acceptance given the object's absence is sufficiently small. Search always terminates (with probability one). Optimum truncated sequential policies are also considered. Methods are given for evaluating some pertinent properties and for investigating the possibility that no object occurs at any location.     

MAD: Mathematical analysis of downtime

The MAD model presents a mathematic treatment of the relationship between aircraft reliability and maintainability, system manning and inspection policies, scheduling and sortie length, and aircraft downtime. Log normal distributions are postulated for subsystem repair times and simultaneous repair of malfunctions is assumed. The aircraft downtime for maintenance is computed with the distribution of the largest of k log normal distributions. Waiting time for maintenance men is calculated either by using a multiple-channel queuing model or by generating the distribution of the number of maintenance men required and comparing this to the number of men available to determine the probability of waiting at each inspection.     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

通用对潜搜索作战模型效能计算方法

对潜搜索模型有很多种,并且这些搜索模型可能因为进一部的完善、优化而发生改变;根据装备的发展及部队作战、训练的需要,也可能有新的模型不断加入.这些模型的作战效果指标是决定其是否可用的重要依据之一,而作战效果的计算应基于统一的方法,而不能各自不同,这样,得出的结论才具有可比性.为了实现这个目的,建立了基于蒙特卡罗法的通用计...     

Theorist of Maritime Strategy: Sir Julian Corbett and his Contribution to Military and Naval Thought

The Volkssturm (People's Storm or Home Guard) was formed by the Nazi Party in late 1944 as Allied forces closed in on the Reich from the east and west. The political ambitions of Martin Bormann, Hitler's secretary and the head of the Nazi Party Chancellery, were the driving force for this new national organisation. Lacking resources, the Volkssturm's military value was negligible even in eastern Germany where battalions occasionally fought with great tenacity against the Red Army. However, its foundations, character and nature were indicative of the process through which Party power had reached its zenith on the eve of the Third Reich's collapse.