Book contents
- Frontmatter
- Contents
- List of figures
- List of tables
- Preface
- Part I Theoretical underpinnings
- Part II Direct deterrence
- Part III Extended deterrence
- Part IV Implications
- Appendices
- 1 Deterrence models
- 2 Useful definitions
- 3 Rudimentary Asymmetric Deterrence Game
- References
- Index
- CAMBRIDGE STUDIES IN INTERNATIONAL RELATIONS
3 - Rudimentary Asymmetric Deterrence Game
Published online by Cambridge University Press: 01 October 2009
- Frontmatter
- Contents
- List of figures
- List of tables
- Preface
- Part I Theoretical underpinnings
- Part II Direct deterrence
- Part III Extended deterrence
- Part IV Implications
- Appendices
- 1 Deterrence models
- 2 Useful definitions
- 3 Rudimentary Asymmetric Deterrence Game
- References
- Index
- CAMBRIDGE STUDIES IN INTERNATIONAL RELATIONS
Summary
This appendix contains the detailed analysis of the Rudimentary Asymmetric Deterrence Game with incomplete information introduced in section 3.4 and specified in detail in section A1.1. (See also figure 3.7 and figure A1.1.)
Recall that the eight parameter values satisfy 0 < pB < 1, aDD < aSQ < aDC, and bDD− < bDC < bDD+ < bSQ. Moreover, player B is Hard, i.e. B's utility for outcome DD is bDD+, with probability pB, and B is Soft, i.e. B's utility for outcome DD is bDD–, with probability 1 – pB. Observe that there is one-sided incomplete information in this game – there are two types of B, but only one type of A.
Our primary objective is to identify the Bayesian equilibria of the Rudimentary Asymmetric Deterrence Game. For details on Bayesian equilibria and perfect Bayesian equilibria, see Fudenberg and Tirole (1991). We take A's only strategic variable to be x, and B's strategic variables to be yH and yS, as follows:
x = Pr {A chooses D}
yH = Pr {B chooses D | B is Hard}
yS = Pr {B chooses D | B is Soft}
This produces the game shown in figure A3.1. Bayesian equilibria will be denoted [x; yH, yS].
First, yH = 1 and yS = 0 at any Bayesian equilibrium. This is easy to verify (see figure A3.1): at node 2, B must choose D (y = 1), yielding outcome DD, or C (y = 0), yielding outcome DC.
- Type
- Chapter
- Information
- Perfect Deterrence , pp. 328 - 330Publisher: Cambridge University PressPrint publication year: 2000