一种基于纳什议价解的自组网时隙分配策略

自组网中的分布式多节点资源分配问题为NP完全问题,一般采用启发式算法进行协议设计,缺少严格的数学证明.基于博弈与纳什议价解理论,提出了一种分布式动态时隙分配策略,并通过严格的数学推导,证明了自组网中不同节点之间的时隙竞争问题存在纳什议价解,为自组网中分布式动态时分多址信道访问控制协议的设计提供了理论依据.     

装备采购委托代理关系分析

针对目前采用的委托方对代理方的激励与约束机制设计,利用博弈论方法分析了监督策略成本会引起最优解迁移,并以实例予以了说明.同时,给出了军事经济效能观测指标的选择原则和多行动代理方的激励机制设计原则.     

基于梯度迭代法的一类追逃对抗模型研究

针对一类追逃对抗问题,基于微分对策理论,建立了三维空间中的追逃对抗模型,进而得到了最优性条件和最优策略.运用梯度迭代法给出了模型的数值解,并做了实例分析.分析结果显示,该模型可以很好地应用于潜艇对潜艇、潜艇对水面舰艇等实际追逃对抗问题.     

Modeling multiple stage manufacturing systems with generalized costs and capacity issues

This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Markets for surplus components with a strategic supplier

We study markets for surplus components, which allow manufacturers with excess component inventory to sell to firms with a shortage. Recent developments in internet commerce have the potential to greatly increase the efficiency of such markets. We develop a one‐period model in which a monopolist supplier sells to a number of independent manufacturers who are uncertain about demand for final goods. After uncertainty is resolved, the manufacturers have the opportunity to trade. Because uncertainty is over demand functions, the model allows us to endogenize both the price of final goods and the price of components in wholesale and surplus markets. We derive conditions on demand uncertainty that determine whether a surplus market will increase or decrease supplier profits. Increased costs of transacting on the surplus market may benefit manufacturers, because of the impact of these costs on the supplier's pricing power. The surplus market can decrease overall efficiency of the supply chain, since the benefit of better allocation of components may be outweighed by an increased double‐marginalization effect. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A multi‐objective model for bank ATM networks

In this paper we present an application of the core solution concepts for multi‐objective games to a bank ATM network model. In these games, the worth of a coalition is given by a subset of vectors of the k‐dimensional space rather than by a scalar. The paper investigates how an ATM network model based on multi‐objective cooperative game theory could be used as an alternative way of setting interchange fees paid by the customer's bank to the one that owns the ATM. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A robust policy for serial agile production systems

One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Evaluating methods for the reliability of a large 2‐dimensional rectangular k‐within‐consecutive‐(r,s)‐out‐of‐(m,n):F system

A 2‐dimensional rectangular k‐within‐consecutive‐(r, s)‐out‐of‐(m, n):F system consists of m × n components, and fails if and only if k or more components fail in an r × s submatrix. This system can be treated as a reliability model for TFT liquid crystal displays, wireless communication networks, etc. Although an effective method has been developed for evaluating the exact system reliability of small or medium‐sized systems, that method needs extremely high computing time and memory capacity when applied to larger systems. Therefore, developing upper and lower bounds and accurate approximations for system reliability is useful for large systems. In this paper, first, we propose new upper and lower bounds for the reliability of a 2‐dimensional rectangular k‐within‐consecutive‐(r, s)‐out‐of‐(m, n):F system. Secondly, we propose two limit theorems for that system. With these theorems we can obtain accurate approximations for system reliabilities when the system is large and component reliabilities are close to one. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Network routing for insurgency: An adversarial risk analysis framework

Problems in counterterrorism and corporate competition have prompted research that attempts to combine statistical risk analysis with game theory in ways that support practical decision making. This article applies these methods of adversarial risk analysis to the problem of selecting a route through a network in which an opponent chooses vertices for ambush. The motivating application is convoy routing across a road network when there may be improvised explosive devices and imperfect intelligence about their locations. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011