Pick a model. Each one is built from the original article, with its notation and results cited to the source, by page or chapter.

Choose a model to begin, or start the walkthrough for a guided tour of the main results.

How to read it

Each card opens one model. The top of the page describes the setup in plain language, the figures show the game and its equilibrium, and the panel on the right reports the equilibrium, explains what your last change did, and holds the sliders. Some models have several parts, shown as tabs under the title.

Related tool

Fearon’s 1997 comparison of tying hands and sinking costs is already built as module B of the Deterrence Lab, so it is not repeated here. The Deterrence Lab’s audience-cost module is a two-type, one-round simplification; the audience-cost model in this gallery is Fearon’s 1994 war of attrition itself.

What we simplified, and what we left out

Sources

Every source below except Fearon 1997, which the Deterrence Lab covers, and Schelling 1966, cited through Powell 1987, was opened and read for this tool; results are cited to the printed page. No outside data are used.

    Method

    Fearon 1995. Issue \(x\in[0,1]\). War gives A \(p-c_A\) and B \(1-p-c_B\), so both prefer any \(x\in(p-c_A,\,p+c_B)\) (p. 387). With a first-strike advantage the de facto range is \((p_f-c_A,\,p_s+c_B)\), empty iff \(p_f-p_s>c_A+c_B\) (p. 403). With \(c_B\sim U[0,\bar c]\), A’s demand solves \(\tfrac{h(x-p)}{1-H(x-p)}=\tfrac{1}{x-p+c_A}\) (Claim 2, p. 411), giving \(x^*=p+(\bar c-c_A)/2\) clipped to \([p,1]\) and a risk of war \(H(x^*-p)\). Preventive war occurs iff \(\delta p_2-p_1>c_B(1-\delta)^2\) (p. 406).

    Powell 2006. With flow value \(B=1/(1-\delta)\) and lock-in payoffs \(M_j(t)\), bargaining breaks down if

    $$\delta M_1(t+1)-M_1(t)\;>\;B-[M_1(t)+M_2(t)]\qquad\text{(p. 182)}.$$

    For a shift from \(p\) to \(p+\Delta\) with destruction \(d\) this is \((1-d)[\delta(p+\Delta)-p]>d\) (p. 183); for first-strike advantage \(f\), \([(1+\delta)f-(1-\delta)p](1-d)>d\), with the de facto range empty iff \(2f(1-d)>d\) (pp. 184-185); for territory, equation (3) on p. 187; for factions, \(d[r(1-\lambda)+(1-r)\lambda]\lt p(1-d)(r'-r)(1-2\lambda)\) (p. 190).

    Brinkmanship (Powell 1987). Chicken critical risk \(r=(w-c)/[(w-c)+(s-d)]\); resolve \(R=(w-s)/(w-d)\) (pp. 721, 725). Bids alternate at risks \(f,2f,3f,\dots\) and the first state whose bid would exceed its resolve loses (Proposition 1). With one-sided uncertainty (Proposition 2, p. 728):

    $$\begin{aligned}b^*&=\frac{[1-(1-2f)(1-3f)](1-R_I)}{(1-2f)[(1-3f)R_I+3f]},\\ e_I(1)&=\frac{R_{II}-f}{(1-f)[(1-2f)R_{II}+2f]},\\ e_{II}(1)&=\frac{b^*(1-p)}{p(1-b^*)}.\end{aligned}$$

    Fearon 1994. With \(a_i(t)=a_it\) and \(w_i\sim U[-W_i,0]\), \(u_i(t)=F_j(-a_jt)v-[1-F_j(-a_jt)]a_it\) and \(t^*=\min_i t_i^*\) where \(u_i(t_i^*)=0\) (p. 584). Labeling so that \(t^*=t_2^*\): \(Q_1(t)=\tfrac{a_2t}{v+a_2t}\), \(Q_2(t)=\tfrac{k_1+a_1t}{v+a_1t}\), \(k_1=u_1(t^*)\).

    Jervis 1978. Cooperate iff \(qCC+(1-q)CD\ge qDC+(1-q)DD\), i.e. \(q\ge q^*=\tfrac{DD-CD}{(CC-DC)+(DD-CD)}\).

    Kydd 2000. Trust-game threshold \(p^*=S/(R+S)\) (p. 332). A gesture \(\alpha^*\) separates iff (p. 354)

    $$\frac{T_{1M}}{T_{1M}-p_2R_{1M}+(1-p_2)S_{1M}}\;<\;\alpha^*\;<\;\frac{R_{1N}}{(1-p_2)(R_{1N}+S_{1N})}.$$

    Slantchev 2003. Offers solve \(1-x_k=(1-\delta)b_2+\delta[p\,y_{k+1}+(1-p)y_{k-1}]\) and \(1-y_k=(1-\delta)b_1+\delta[p\,x_{k+1}+(1-p)x_{k-1}]\) (p. 630), with the flow of benefits π normalized to 1; beliefs update by Bayes’ rule on battle outcomes (eq. 4); the separating equilibrium’s offers and conditions are equations (2)-(7) on pp. 630-631.

    Rubinstein 1982. Player 1’s share \(M=\tfrac{1-\delta_2}{1-\delta_1\delta_2}\) (p. 108); with fixed costs, 1 gets \(c_2\) if \(c_1>c_2\) and everything if \(c_1\lt c_2\) (p. 107).