Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 20 March 2019

Abstract and Keywords

Game theory analyzes strategic decision making of multiple interdependent actors and has become influential in economics, political science, and sociology. It provides novel insights in criminology because it is a universal language for the unification of the social and behavioral sciences and allows deriving new hypotheses from fundamental assumptions about decision making. This chapter first reviews foundations and assumptions of game theory, basic concepts, and definitions. This includes applications of game theory to offender decision making in different strategic interaction settings: simultaneous and sequential games and signaling games. Next, the chapter illustrates the benefits (and problems) of game theoretical models for the analysis of crime and punishment by providing an in-depth discussion of the “inspection game.” The formal analytics are described, point predictions are derived, and hypotheses are tested by laboratory experiments. The chapter concludes with a discussion of theoretical and practical implications of results from the inspection game.

Keywords: game theory, strategic interaction, inspection games, laboratory experiments, criminology

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.