Abstract:
Delinquents are embedded in a network of relationships. Social ties among delinquents are modelled by means of a graph where delinquents compete for a booty and benefit from local interactions with their neighbors. Each delinquent decides in a non-cooperative way how much delinquency effort he will exert. Using the network model developed by Ballester et al. (2006), we characterize the Nash equilibrium and derive an optimal enforcement policy, called the key-player policy, which targets the delinquent who, once removed, leads to the highest aggregate delinquency reduction. We then extend our characterization of optimal single player network removal for delinquency reduction, the key player, to optimal group removal, the key group. We also characterize and derive a policy that targets links rather than players. Finally, we endogenize the network connecting delinquents by allowing players to join the labor market instead of committing delinquent offenses. The key-player policy turns out to be much more complex since it depends on wages and on the structure of the network.
Downloads: (external link) http://www.cepr.org/pubs/dps/DP7293.asp (application/pdf)
CEPR Discussion Papers are free to download for our researchers, subscribers and members. If you fall into one of these categories but have trouble downloading our papers, please contact us at subscribers@cepr.org
Related works: Working Paper: Delinquent Networks (2009) Working Paper: Delinquent Networks (2009) This item may be available elsewhere in EconPapers: Search for items with the same title.
More papers in CEPR Discussion Papers from C.E.P.R. Discussion Papers Address: Centre for Economic Policy Research, 53--56 Great Sutton Street, London EC1V 0DG Series data maintained by ().
This site is part of RePEc
and all the data displayed here is part of the RePEc data set.
Is your work missing from RePEc? Here is how to
contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .