False targets efficiency in defense strategy

The paper analyzes the efficiency of deploying false targets as part of a defense strategy. It is assumed that the defender has a single object that can be destroyed by the attacker. The defender distributes its resource between deploying false targets and protecting the object from outside attacks. The attacker cannot distinguish the false targets from the defended object (genuine target). Therefore the attacker has no preferences for attacking one target rather than another target. The defender decides how many false targets to deploy whereas the attacker decides how many targets to attack. The article assumes that both the defender and attacker have complete information and full rationality. The optimal number of false targets and the attacked targets are obtained for the case of fixed and variable resources of the defender and the attacker as solutions of a non-cooperative game between the two agents.     

Strategic defense and attack for series and parallel reliability systems

A system of independent components is defended by a strategic defender and attacked by a strategic attacker. The reliability of each component depends on how strongly it is defended and attacked, and on the intensity of the contest. In a series system, the attacker benefits from a substitution effect since attacker benefits flow from attacking any of the components, while the defender needs to defend all components. Even for a series system, when the attacker is sufficiently disadvantaged with high attack inefficiencies, and the intensity of the contest is sufficiently high, the defender earns maximum utility and the attacker earns zero utility. The results for the defender (attacker) in a parallel system are equivalent to the results for the attacker (defender) in a series system. Hence, the defender benefits from the substitution effect in parallel systems. With budget constraints the ratio of the investments for each component, and the contest success function for each component, are the same as without budget constraints when replacing the system values for the defender and attacker with their respective budget constraints.     

Optimal resource allocation for security in reliability systems

Recent results have used game theory to explore the nature of optimal investments in the security of simple series and parallel systems. However, it is clearly important in practice to extend these simple security models to more complicated system structures with both parallel and series subsystems (and, eventually, to more general networked systems). The purpose of this paper is to begin to address this challenge. While achieving fully general results is likely to be difficult, and may require heuristic approaches, we are able to find closed-form results for systems with moderately general structures, under the assumption that the cost of an attack against any given component increases linearly in the amount of defensive investment in that component. These results have interesting and sometimes counterintuitive implications for the nature of optimal investments in security.     

Constrained cost-coupled stochastic games with independent state processes

We study non-cooperative constrained stochastic games in which each player controls its own Markov chain based on its own state and actions. Interactions between players occur through their costs and constraints which depend on the state and actions of all players. We provide an example from wireless communications.     

Coordination in decentralized assembly systems with uncertain component yields

The literature on assembly systems with random component yields has focused on centralized systems, where a single decision maker chooses all components’ production quantities and incurs all the costs. We consider a decentralized setting where the component suppliers choose their production quantities based solely on their own cost/reward structure, and the assembly firm makes ordering decisions based on its own cost/reward structure. When the suppliers control their inputs but the outputs exhibit random yields, coordination in such systems becomes quite complex. In such situations, incentive alignment control mechanisms are needed so that the suppliers will choose production quantities as in the centralized system case. One such mechanism is to penalize the supplier with the worse delivery performance. We analyze the conditions under which system coordination is achieved while respecting participation constraints. Further, we determine the optimal component ordering policy for the assembly firm and derive the optimal coordinating penalties.     

Optimal maintenance service contract negotiation with aging equipment

In recent years, there has been a growing trend to out-source service operations in which the equipment maintenance is carried out by an external agent rather than in-house. Often, the agent (service provider) offers more than one option and the owners of equipment (customers) are faced to the problem of selecting the optimal option, under the terms of a contract. In the current work, we develop a model and report results to determine the agent’s optimal strategy for a given type of contract. The model derives in a non-cooperative game formulation in which the decisions are taken by maximizing expected profits. This work extends previous models by considering the realistic case of equipments having an increasing failure intensity due to imperfect maintenance, instead of the standard assumption that considers failure times are exponentially distributed (constant failure intensity). We develop a model using a linear function of time to characterize the failure intensity. The main goal, for the agent, is to determine the pricing structure in the contract and the number of customers to service. On the other hand, for the clients, the main goal is to define the period between planned actions for preventive maintenance and the time to replace equipments. In order to give a complete characterization of the results, we also carry out a sensitivity analysis over some of the factors that would influence over the failure intensity.     

Cooperation in assembly systems: The role of knowledge sharing networks

Process improvement plays a significant role in reducing production costs over the life cycle of a product. We consider the role of process improvement in a decentralized assembly system in which a buyer purchases components from several first-tier suppliers. These components are assembled into a finished product, which is sold to the downstream market. The assembler faces a deterministic demand/production rate and the suppliers incur variable inventory costs and fixed setup production costs. In the first stage of the game, which is modeled as a non-cooperative game among suppliers, suppliers make investments in process improvement activities to reduce the fixed production costs. Upon establishing a relationship with the suppliers, the assembler establishes a knowledge sharing network – this network is implemented as a series of meetings among suppliers and also mutual visits to their factories. These meetings facilitate the exchange of best practices among suppliers with the expectation that suppliers will achieve reductions in their production costs from the experiences learned through knowledge sharing. We model this knowledge exchange as a cooperative game among suppliers in which, as a result of cooperation, all suppliers achieve reductions in their fixed costs. In the non-cooperative game, the suppliers anticipate the cost allocation that results from the cooperative game in the second stage by incorporating the effect of knowledge sharing in their cost functions. Based on this model, we investigate the benefits and challenges associated with establishing a knowledge sharing network. We identify and compare various cost allocation mechanisms that are feasible in the cooperative game and show that the system optimal investment levels can be achieved only when the most efficient supplier receives the incremental benefits of the cost reduction achieved by other suppliers due to the knowledge transfer.     

Improving reliability of a shared supplier with competition and spillovers

Supplier reliability is a key determinant of a manufacturer’s competitiveness. It reflects a supplier’s capability of order fulfillment, which can be measured by the percentage of order quantity delivered in a given time window. A perfectly reliable supplier delivers an amount equal to the order placed by its customer, while an unreliable supplier may deliver an amount less than the amount ordered. Therefore, when suppliers are unreliable, manufacturers often have incentives to help suppliers improve delivery reliability. Suppliers, however, often work with multiple manufacturers and the benefit of enhanced reliability may spill over to competing manufacturers. In this study, we explore how potential spillover influences manufacturers’ incentives to improve supplier’s reliability. We consider two manufacturers that compete with imperfectly substitutable products on Type I service level (i.e., in-stock probability). The manufacturers share a common supplier who, due to variations in production quality or yield, is unreliable. Manufacturers may exert efforts to improve the supplier’s reliability in the sense that the delivered quantity is stochastically larger after improvement. We develop a two-stage model that encompasses supplier improvement, uncertain supply and random demand in a competitive setting. In this complex model, we characterize the manufacturers’ equilibrium in-stock probability. Moreover, we characterize sufficient conditions for the existence of the equilibrium of the manufacturers’ improvement efforts. Finally, we numerically test the impact of market characteristics on the manufacturers’ equilibrium improvement efforts. We find that a manufacturer’s equilibrium improvement effort usually declines in market competition, market uncertainty or spillover effect, although its expected equilibrium profit typically increases in spillover effect.     

On competitive sequential location in a network with a decreasing demand intensity

We introduce and analyze a Hotelling like game wherein players can locate in a city, at a fixed cost, according to an exogenously given order. Demand intensity is assumed to be strictly decreasing in distance and players locate in the city as long as it is profitable for them to do so. For a linear city (i) we explicitly determine the number of players who will locate in equilibrium, (ii) we fully characterize and compute the unique family of equilibrium locations, and (iii) we show that players’ equilibrium expected profits decline in their position in the order. Our results are then extended to a city represented by an undirected weighted graph whose edge lengths are not too small and co-location on nodes of the graph is not permitted. Further, we compare the equilibrium outcomes with the optimal policy of a monopolist who faces an identical problem and who needs to decide upon the number of stores to open and their locations in the city so as to maximize total profit.     

Multiscale decision-making: Bridging organizational scales in systems with distributed decision-makers

Decision-making in organizations is complex due to interdependencies among decision-makers (agents) within and across organizational hierarchies. We propose a multiscale decision-making model that captures and analyzes multiscale agent interactions in large, distributed decision-making systems. In general, multiscale systems exhibit phenomena that are coupled through various temporal, spatial and organizational scales. Our model focuses on the organizational scale and provides analytic, closed-form solutions which enable agents across all organizational scales to select a best course of action. By setting an optimal intensity level for agent interactions, an organizational designer can align the choices of self-interested agents with the overall goals of the organization. Moreover, our results demonstrate when local and aggregate information exchange is sufficient for system-wide optimal decision-making. We motivate the model and illustrate its capabilities using a manufacturing enterprise example.     

A two-population game in observable double-ended queuing systems

In this study, the existing game theoretical framework is extended to strategic queuing in search of solutions for a two-population game in observable double-ended queuing systems with zero matching times. We show that multiple Nash equilibria and one unique subgame perfect Nash equilibrium exist in this game.     

Evasion from many pursuers in simple motion differential game with integral constraints

We study a two dimensional evasion differential game with several pursuers and one evader with integral constraints on control functions of players. Assuming that the total resource of the pursuers does not exceed that of the evader, we solve the game by presenting explicit strategy for the evader which guarantees evasion.     

Balancing congestion and security in the presence of strategic applicants with private information

Concerns on security and congestion appear in security screening which is used to identify and deter potential threats (e.g., attackers, terrorists, smugglers, spies) among normal applicants wishing to enter an organization, location, or facility. Generally, in-depth screening reduces the risk of being attacked, but creates delays that may deter normal applicants and thus, decrease the welfare of the approver (authority, manager, screener). In this paper, we develop a model to determine the optimal screening policy to maximize the reward from admitting normal applicants net of the penalty from admitting bad applicants. We use an M/M/1 queueing system to capture the impact of security screening policies on system congestion and use game theory to model strategic behavior, in which potential applicants with private information can decide whether to apply based on the observed approver’s screening policy and the submission behavior of other potential applicants. We provide analytical solutions for the optimal non-discriminatory screening policy and numerical illustrations for both the discriminatory and non-discriminatory policies. In addition, we discuss more complex scenarios including imperfect screening, abandonment behavior of normal applicants, and non-zero waiting costs of attackers.     

Pricing policies for substitutable products in a supply chain with Internet and traditional channels

This study considers pricing policies in a supply chain with one manufacturer, who sells a product to an independent retailer and directly to consumers through an Internet channel. In addition to the manufacturer’s product, the retailer sells a substitute product produced by another manufacturer. Given the wholesale prices of the two substitute products, the manufacturer decides the retail price of the Internet channel, and the retailer decides the retail prices of the two substitute products. Both the manufacturer and the retailer choose their own decision variables to maximize their respective profits. This work formulates the price competition, using the settings of Nash and Stackelberg games, and derives the corresponding existence and uniqueness conditions for equilibrium solutions. A sensitivity analysis of an equilibrium solution is then conducted for the model parameters, and the profits are compared for two game settings. The findings show that improving brand loyalty is profitable for both of the manufacturer and retailer, and that an increased service value may alleviate the threat of the Internet channel for the retailer and increase the manufacturer’s profit. The study also derives some conditions under which the manufacturer and the retailer mutually prefer the Stackelberg game. Based on these results, this study proposes an appropriate cooperation strategy for the manufacturer and retailer.     

Cooperative advertising in a distribution channel with fairness concerns

Cooperative (co-op) advertising has been widely used in practice and employed as a strategy to improve the performance of a distribution channel. It is known from the existing models that co-op advertising could not achieve the channel coordination (i.e., maximize the total channel profit). In this paper, we consider a distribution channel consisting of a single manufacturer and a single retailer, and investigate the effect of the retailer’s fairness concerns. Applying the equilibrium analysis, we obtain the following results: (1) Channel coordination can be achieved if the retailer has fairness concerns and model parameters satisfy certain conditions. (2) Although both channel members become better off with co-op advertising if neither channel member has fairness concerns, we find situations where co-op advertising brings detrimental effects to the retailer if the retailer has fairness concerns. (3) The retailer’s fairness concerns may increase or decrease the equilibrium participation rate, the equilibrium advertising effort, and the equilibrium profit of the manufacturer and the whole channel. (4) We identify the conditions under which the effectiveness of co-op advertising can be improved or reduced by the retailer’s fairness concerns. As long as co-op advertising can bring extra profit to the manufacturer, the retailer’s fairness concerns could improve the effectiveness of the co-op advertising. (5) There exists a Pareto improvement for the profits of both the manufacturer and the retailer when a retailer without fairness concerns becomes fair-minded.     

A cost allocation problem arising in hub–spoke network systems

This paper studies a cost allocation problem arising from hub–spoke network systems. When a large-scale network is to be constructed jointly by several agents, both the optimal network design and the fair allocation of its cost are essential issues. We formulate this problem as a cooperative game and analyze the core allocation, which is a widely used solution concept. The core of this game is not necessarily non-empty as shown by an example. A reasonable scheme is to allocate the cost proportional to the flow that an agent generates. We show that, if the demand across the system has a block structure and the fixed cost is high, this cost allocation scheme belongs to the core. Numerical experiments are given with real telecommunication traffic data in order to illustrate the usefulness of our analytical findings.     

Equilibrium analysis in batch-arrival queues with complementary services

This paper studies a batch-arrival queue with two complementary services. The two services are complementary and any customer has no benefit from obtaining just one of them. To the best of the authors’ knowledge, there are no works contributed to the batch-arrival queues on analysis of the equilibrium behaviors in queueing systems by now. The properties of batch-arrival queues, which is more practical and universal in reality, induce different Nash equilibria under competition or monopoly compared with the single-arrival queues. We observe the joint effect of batch joining rate and cost structure on the behavior of customers and graphically interpret the equilibrium solutions under competition. Moreover, we discuss the model under three types of price structures and give comparisons from customer and server points.     

Aging properties of the residual life length of k‐out‐of‐n systems with independent but non‐identical components

The k‐out‐of‐n structure is a very popular type of redundancy in fault‐tolerant systems, it has founded wide applications in industrial and military systems during the past several decades. This paper will investigate the residual life length of a k‐out‐of‐n system with independent (not necessarily identical) components, given that the (n?k)th failure has occurred at time t?0. Behaviour of PF₂, IFR, DRHR, DMRL, NBU(2) and NBUC classes of life distributions are derived in terms of the monotonicity of the residual life given the time of the (n?k)th failure. Copyright © 2004 John Wiley & Sons, Ltd.     

Age-dependent production planning and maintenance strategies in unreliable manufacturing systems with lost sale

In this paper, we formulate an analytical model for the joint determination of an optimal age-dependent buffer inventory and preventive maintenance policy in a production environment that is subject to random machine breakdowns. Traditional preventive maintenance policies, such as age and periodic replacements, are usually studied based on simplified and non-realistic assumptions, as well as on the expected costs criterion. Finished goods inventories and the age-dependent likelihood of machine breakdowns are usually not considered. As a result, these policies could significantly extend beyond the anticipated financial incomes of the system, and lead to crises. In order to solve this problem, a more realistic analysis model is proposed in this paper to consider the effects of both preventive maintenance policies and machine age on optimal safety stock levels. Hence, a unified framework is developed, allowing production and preventive maintenance to be jointly considered. We use an age-dependent optimization model based on the minimization of an overall cost function, including inventory holdings, lost sales, preventive and corrective maintenance costs. We provide optimality conditions for the manufacturing systems considered, and use numerical methods to obtain an optimal preventive maintenance policy and the relevant age-dependent threshold level production policy. In this work, this policy is called the multiple threshold levels hedging point policy. We include numerical examples and sensitivity analyses to illustrate the importance and the effectiveness of the proposed methodology. Compared with other available optimal production and maintenance policies, the numerical solution obtained shows that the proposed age-dependent optimal production and maintenance policies significantly reduce the overall cost incurred.     

Pure-strategy Nash equilibria in an advertising game with interference

Two manufacturers produce substitutable goods for a homogeneous market. The advertising efforts of the two manufacturers determine the demand for the goods and interfere negatively with each other. The demand of each good is a piecewise linear function of the product goodwill, and the latter is a linear function of advertising efforts. In a game with two competing profit-maximizing manufacturers who have access to a set of several advertising media, the pure-strategy Nash equilibria are characterized and their existence is shown.