  Recently developed toy models for the mean-field games of corruption and
botnet defence in cyber-security with three or four states of agents are
extended to a more general mean-field-game model with $2d$ states, $d\in \N$.
  In order to tackle new technical difficulties arising from a larger
state-space we introduce new asymptotic regimes, namely small discount and
small interaction asymptotics. Moreover, the link between stationary and
time-dependent solutions is established rigorously leading to a performance of
the turnpike theory in a mean-field-game setting.
