Delinquent Networks

Abstract

Delinquents are embedded in a network of relationships. Each delinquent decides in a non-cooperative way how much delinquency effort he will exert. We characterize the Nash equilibrium and derive an optimal enforcement policy, called the key-player policy. We then extend our characterization of optimal single player network removal 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 because it depends on wages and on the structure of the network.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 40 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.