This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

A debt behaviour model

Wenjun Zhang, John Holt
Refer to caption
Figure 1: This diagram depicts the underlying causal structure of the model. See the text for the definitions of D,Y,B,T,S.

The model concerns the following random variables:

  • A discrete Markov process BtB_{t} which records the behavioural state of the debtor during the time period tt - measured in months. The state is measured in the middle of each month.

  • A discrete-valued process TtT_{t} which records the strongest debt management intervention that was applied to the debtor during the time period tt.

  • RR an entity-specific variable, RR gives the final result of the debtor’s most immediate previous debt case - NA, paid in full, liquidation/bankrupty, full write-off, partial write-off.

  • XtX_{t} is the economic state at time period tt. This measure is obtained through clustering a pertinent collection of economic variables: change in CPI, change in unemployment, change in the average weekly wage, etc. The underlying variables for XtX_{t} are varying quarterly, so XtX_{t} will be constant in blocks of three months.

  • StS_{t} is a latent discrete Markov process which categorizes debtors in a time period into the behavioural scheme that governs the generation of BtB_{t}. The model supposes that Tt1T_{t-1} influences StS_{t}, and hence influences BtB_{t} indirectly.

  • DtD_{t} is a positive real-valued variable, given by

    Dt=Debt amount at time t, including penalties and interestLargest amount of debt owed up to time t, excluding penalties and interestD_{t}=\frac{\text{Debt amount at time $t$, including penalties and interest}}{\text{Largest amount of debt owed up to time $t$, excluding penalties and interest}}
  • YtY_{t} is a categorization of DtD_{t} into {0,1}\{0,1\} - this is governed by a parameter α\alpha that needs to be inferred. the notion is that as a debtor gets closer to being paid in full, its probability of making a large lump-sum payment to clear its debt may change.

We introduce a set of parameters as follows:

  • α\alpha: defined by Yt:=0Y_{t}:=0 if and only if DtαD_{t}\leq\alpha.

  • QSQ_{S}: a list of transition matrices, one for each combination of values of R,Xt,Tt1R,X_{t},T_{t-1}.

  • πS\pi_{S}: a list of initial probabilities, one for each combination of values of R,XtR,X_{t}.

  • QBQ_{B}: a list of transition matrices, one for each combination of values of Yt1Y_{t-1} and StS_{t}.

  • πB\pi_{B}: a list of initial probabilities, one for each value of S1S_{1}.

Figure 2 depicts the causal structure of the variables and the parameters - we have now expressed each of the variables as a vector of length as long as the number of observation periods.

Refer to caption
Figure 2: This diagram depicts the underlying causal structure of the model, including the parameters. Refer to the text for definitions of the parameters πB,QB,πS,QS,α\pi_{B},Q_{B},\pi_{S},Q_{S},\alpha

Every debt case begins at a time period uu and ends at a time period ll. If the debt case is indexed by ii, the the beginning is uiu_{i} and the end is lil_{i}. There will be observations of TtT_{t}, BtB_{t}, DtD_{t}, and XtX_{t} from uiu_{i} through to lil_{i}.

The log-likelihood of observing a single debt case is maximized when we maximize:

l0=t=u+1t=l(ln(QBYt1,St(Bt1,Bt))+ln(QSXt,R,Tt1(St1,St)))+ln(πBSu(Bu))+ln(πSXu,R(Su))l_{0}=\sum_{t=u+1}^{t=l}(\ln(Q_{B}^{Y_{t-1},S_{t}}(B_{t-1},B_{t}))+\ln(Q_{S}^{X_{t},R,T_{t-1}}(S_{t-1},S_{t})))+\ln(\pi^{S_{u}}_{B}(B_{u}))+\ln(\pi_{S}^{X_{u},R}(S_{u}))

We apply the EM algorithm to l0l_{0}, taking the expected value of l0l_{0} conditional on {Bt,Xt,Dt,Tt,R}\{B_{t},X_{t},D_{t},T_{t},R\} and the kk-th iteration of the parameters {α,QB,QS,πB,πS}\{\alpha,Q_{B},Q_{S},\pi_{B},\pi_{S}\}, Θk\Theta^{k}.

For this we define the responsibilities for each debt case, ii, and time tt, t=ui,,lit=u_{i},\ldots,l_{i}:

γi,t(s):=p(St=s|Tuili1,Xuili,Buili,Ri,Duili1)\gamma_{i,t}(s):=p(S_{t}=s|T_{u_{i}}^{l_{i}-1},X_{u_{i}}^{l_{i}},B_{u_{i}}^{l_{i}},R_{i},D_{u_{i}}^{l_{i}-1})

for tuit\geq u_{i}; and for t>uit>u_{i},

Γi,t(p,q):=p(St=q,St1=p|Tuili1,Buili,Ri,Duili1)\Gamma_{i,t}(p,q):=p(S_{t}=q,S_{t-1}=p|T_{u_{i}}^{l_{i}-1},B_{u_{i}}^{l_{i}},R_{i},D_{u_{i}}^{l_{i}-1})

It is clear that γi,t(s)=pΓi,t(p,s)\gamma_{i,t}(s)=\sum_{p}\Gamma_{i,t}(p,s), or if t=uit=u_{i}, γi,ui(s)=qΓi,ui+1(s,q)\gamma_{i,u_{i}}(s)=\sum_{q}\Gamma_{i,u_{i}+1}(s,q) - hence we need only compute Γi,t\Gamma_{i,t}.

This is done using the Forward-Backward algorithm:

1 Calculating Γi,t\Gamma_{i,t}

This calculation is standard, but we present it for completeness.

Define the following four sets of probabilities:

  • πt(s)=p(St=s|Tul1,Xul,R,Dul1,Bul)\pi_{t}(s)=p(S_{t}=s|T_{u}^{l-1},X_{u}^{l},R,D_{u}^{l-1},B_{u}^{l})

  • πt(s)=p(St=s|Tut1,Xut,R,Dut1,But)\pi_{t}^{\prime}(s)=p(S_{t}=s|T_{u}^{t-1},X_{u}^{t},R,D_{u}^{t-1},B_{u}^{t}), tut\geq u.

  • Ft(p,q)=p(St1=p,St=q|Tut1,Xut,R,Dut1,But)F_{t}(p,q)=p(S_{t-1}=p,S_{t}=q|T_{u}^{t-1},X_{u}^{t},R,D_{u}^{t-1},B_{u}^{t}), t>ut>u

  • Γt(p,q)=p(St1=p,St=q|Tul1,Xul,R,Dul1,Bul)\Gamma_{t}(p,q)=p(S_{t-1}=p,S_{t}=q|T_{u}^{l-1},X_{u}^{l},R,D_{u}^{l-1},B_{u}^{l}),t>ut>u.

Then

Ft(p,q)\displaystyle F_{t}(p,q) \displaystyle\propto QBq,Yt1(Bt1,Bt)QSTt1,Xt,R(p,q)πt1\displaystyle Q_{B}^{q,Y_{t-1}}(B_{t-1},B_{t})Q_{S}^{T_{t-1},X_{t},R}(p,q)\pi_{t-1}^{\prime}
=\displaystyle= (QBq,0(Bt1,Bt)I[0,α](Dt1)+QBq,1(Bt1,Bt)I(α,)(Dt1))QSTt1,Xt,R(p,q)\displaystyle(Q_{B}^{q,0}(B_{t-1},B_{t})I_{[0,\alpha]}(D_{t-1})+Q_{B}^{q,1}(B_{t-1},B_{t})I_{(\alpha,\infty)}(D_{t-1}))Q_{S}^{T_{t-1},X_{t},R}(p,q)

and

πt(q)=pFt(p,q)\pi_{t}^{\prime}(q)=\sum_{p}F_{t}(p,q)

with πu(s)πBs(Bu)πSXu,R(s)\pi_{u}^{\prime}(s)\propto\pi_{B}^{s}(B_{u})\pi_{S}^{X_{u},R}(s). The normalizing constants can be found by noting that p,qFt(p,q)=1\sum_{p,q}F_{t}(p,q)=1 and sπu(s)=1\sum_{s}\pi_{u}^{\prime}(s)=1.

Having obtained Ft(p,q)F_{t}(p,q) (the forward matrices) we can calculate the backward matrices Γt\Gamma_{t} as follows:

Set Γl=Fl\Gamma_{l}=F_{l}.

For t<lt<l,

Γt(p,q)\displaystyle\Gamma_{t}(p,q) =\displaystyle= p(St1=p|St=q,Tul1,Xul,R,Dul1,Bul)p(St=q|Tul1,Xul,R,Dul1,Bul)\displaystyle p(S_{t-1}=p|S_{t}=q,T_{u}^{l-1},X_{u}^{l},R,D_{u}^{l-1},B_{u}^{l})p(S_{t}=q|T_{u}^{l-1},X_{u}^{l},R,D_{u}^{l-1},B_{u}^{l})
=\displaystyle= p(St1=p|St=q,Tut1,Xut,R,Dut1,But)πt(q)\displaystyle p(S_{t-1}=p|S_{t}=q,T_{u}^{t-1},X_{u}^{t},R,D_{u}^{t-1},B_{u}^{t})\pi_{t}(q)
=\displaystyle= Ft(p,q)πt(q)πt(q)\displaystyle F_{t}(p,q)\frac{\pi_{t}(q)}{\pi_{t}^{\prime}(q)}

2 Update equations for the M-step

The formulas that follow are the result of straightforward calculations.

QBs,y(b,c)\displaystyle Q_{B}^{s,y}(b,c) =\displaystyle= it=ui+1liδ(Bi,tc)δ(Bi,t1b)δ(Yi,t1y)γi,t(s)it=ui+1liδ(Bi,t1b)δ(Yi,t1y)γi,t(s)\displaystyle\frac{\sum_{i}\sum_{t=u_{i}+1}^{l_{i}}\delta(B_{i,t}-c)\delta(B_{i,t-1}-b)\delta(Y_{i,t-1}-y)\gamma_{i,t}(s)}{\sum_{i}\sum_{t=u_{i}+1}^{l_{i}}\delta(B_{i,t-1}-b)\delta(Y_{i,t-1}-y)\gamma_{i,t}(s)}
πBs(b)\displaystyle\pi_{B}^{s}(b) =\displaystyle= iδ(Bi,uib)γi,ui(s)iγi,ui(s)\displaystyle\frac{\sum_{i}\delta(B_{i,u_{i}}-b)\gamma_{i,u_{i}}(s)}{\sum_{i}\gamma_{i,u_{i}}(s)}
QST,R,X(p,q)\displaystyle Q_{S}^{T,R,X}(p,q) =\displaystyle= it=uili1δ(Ti,tT)δ(RiR)δ(XtX)γi,t(p)γi,t+1(q)it=uili1δ(Ti,tT)δ(XtX)δ(RiR)γi,t(p)\displaystyle\frac{\sum_{i}\sum_{t=u_{i}}^{l_{i}-1}\delta(T_{i,t}-T)\delta(R_{i}-R)\delta(X_{t}-X)\gamma_{i,t}(p)\gamma_{i,t+1}(q)}{\sum_{i}\sum_{t=u_{i}}^{l_{i}-1}\delta(T_{i,t}-T)\delta(X_{t}-X)\delta(R_{i}-R)\gamma_{i,t}(p)}
πSR,X(s)\displaystyle\pi_{S}^{R,X}(s) =\displaystyle= iδ(RiR)δ(XuiX)γi,ui(s)iδ(RiR)δ(XuiX)\displaystyle\frac{\sum_{i}\delta(R_{i}-R)\delta(X_{u_{i}}-X)\gamma_{i,u_{i}}(s)}{\sum_{i}\delta(R_{i}-R)\delta(X_{u_{i}}-X)}

Note that QBQ_{B} depends on an unknown value of α\alpha. The approach will be to fit QBQ_{B} for a range of values of α\alpha, and to choose the α\alpha that gives the maximum value to:

l1=it=ui+1lisln(QBs,0(Bi,t1,Bi,t)I[0,α](Di,t1)+QBs,1(Bi,t1,Bi,t)I(α,)(Di,t1))γi,t(s)l_{1}=\sum_{i}\sum_{t=u_{i}+1}^{l_{i}}\sum_{s}\ln(Q_{B}^{s,0}(B_{i,t-1},B_{i,t})I_{[0,\alpha]}(D_{i,t-1})+Q_{B}^{s,1}(B_{i,t-1},B_{i,t})I_{(\alpha,\infty)}(D_{i,t-1}))\gamma_{i,t}(s)