Shield versus sword resource distribution in K-round duels

Collaborative Autonomic Computing Laboratory, School of Computer Science, University of Electronic Science and Technology of China, Chengdu, People’s Republic of China; The Israel Electric Corporation Ltd., Haifa, Israel
Central European Journal of Operations Research (Impact Factor: 0.63). 01/2011; 19(4):589-603. DOI: 10.1007/s10100-010-0148-5

ABSTRACT The paper considers optimal resource distribution between offense and defense in a duel. In each round of the duel two actors
exchange attacks distributing the offense resources equally across K rounds. The offense resources are expendable (e.g. missiles), whereas the defense resources are not expendable (e.g. bunkers).
The outcomes of each round are determined by a contest success functions which depend on the offensive and defensive resources.
The game ends when at least one target is destroyed or after K rounds. We show that when each actor maximizes its own survivability, then both actors allocate all their resources defensively.
Conversely, when each actor minimizes the survivability of the other actor, then both actors allocate all their resources
offensively. We then consider two cases of battle for a single target in which one of the actors minimizes the survivability
of its counterpart whereas the counterpart maximizes its own survivability. It is shown that in these two cases the minmax
survivabilities of the two actors are the same, and the sum of their resource fractions allocated to offense is equal to 1.
However, their resource distributions are different. In the symmetric situation when the actors are equally resourceful and
the two contest intensities are equal, then the actor that fights for the destruction of its counterpart allocates more resources
to offense. We demonstrate a methodology of game analysis by illustrating how the resources, contest intensities and number
of rounds in the duels impact the survivabilities and resource distributions.

KeywordsSurvivability–Duel–Defense–Attack–Protection–Contest intensity–Game theory

  • [Show abstract] [Hide abstract]
    ABSTRACT: We apply game theory, optimization, and reliability analysis to identify optimal defenses against intentional threats to system reliability. The goals are to identify optimal strategies for allocating resources among possible defensive investments, and to develop qualitative guidelines that reflect those strategies. The novel feature of the approach is the use of reliability analysis together with game theory and optimization to study optimal management of intentional threats to system reliability. Thus, this work extends and adapts the existing body of game-theoretic work on security to systems with series or parallel structures. The results yield insights into the nature of optimal defensive investments that yield the best tradeoff between investment cost and security. In particular, the results illustrate how the optimal allocation of defensive investments depends on the structure of the system, the cost-effectiveness of infrastructure protection investments, and the adversary's goals and constraints.
    Reliability Engineering & System Safety. 01/2005;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Joint exchange and raiding can emerge in a world of mutual raiding when the appropriated production is less valuable to the appropriator than to the defender and the defense is not too inferior to attack. The amounts of resources allocated to production and raiding and the amounts of goods exchanged reciprocally are determined endogenously. The model reduces to pure exchange and pure raiding as special cases. Pure exchange emerges when the usability of appropriation is sufficiently low. Pure raiding emerges if the defense is sufficiently inferior to attack. The results of the model are intermediate between the results of the two extreme cases. (JEL C6, C72, D51, D72, D74, F10) Copyright 2004, Oxford University Press.
    Economic Inquiry 02/2004; 42(4):572-586. · 0.98 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: 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.
    European Journal of Operational Research 02/2007; · 2.04 Impact Factor