The paper presents a novel approach based on differential games to the study of criminal networks. We extend the static crime network game (Ballester et al., 2006, 2010) to a dynamic setting. First, we determine the relationship between the Markov Perfect Equilibrium (MPE) and the vector of Bonacich centralities. The established proportionality between the Nash equilibrium and the Bonacich centrality in the static game does not hold in general in the dynamic setting. Next, we provide an explicit characterization of equilibrium strategies, and conduct comparative dynamic analysis with respect to the network size, network density, and the marginal expected punishment. Contrary to the static game, where aggregate equilibrium increases with network size and density, in the dynamic setting, more criminals or more connected criminals can lead to a decrease in total crime, both in the short run and at the steady state. We also examine another novel issue in the network theory literature, i.e., the existence of a voracity effect, occurring when an increase in the implicit growth rate of total wealth in the economy lowers economic growth. We do identify the presence of such a voracity effect in our setting. Finally, we reconsider the problem of identifying the key player in the network, and show that, in general, the key player in the static and the dynamic setting differ.
Paola Labrecciosa (Monash University) – A Dynamic Analysis of Criminal Networks
Ajouter au calendrier
Quand :
29 novembre 2022 @ 11 h 00 – 12 h 00
2022-11-29T11:00:00+01:00
2022-11-29T12:00:00+01:00
Partagez cette actualité !