Jump to ContentJump to Main Navigation
Game Theory, Diplomatic History and Security Studies$
Users without a subscription are not able to see the full content.

Frank C. Zagare

Print publication date: 2019

Print ISBN-13: 9780198831587

Published to Oxford Scholarship Online: February 2019

DOI: 10.1093/oso/9780198831587.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 13 June 2021

Perfect Deterrence Theory

Perfect Deterrence Theory

Chapter:
(p.127) 7 Perfect Deterrence Theory
Source:
Game Theory, Diplomatic History and Security Studies
Author(s):

Frank C. Zagare

Publisher:
Oxford University Press
DOI:10.1093/oso/9780198831587.003.0008

This chapter introduces perfect deterrence theory and contrasts it with classical deterrence theory, which is the prevailing realist theory of interstate war prevention. How and under what conditions war might be prevented is the principal question addressed by both theories. The assumptions, empirical implications, and policy prescriptions of the two approaches to deterrence are discussed. Classical deterrence theory is shown to have both logical and empirical problems. Perfect deterrence theory, which is composed of a number of interrelated game models that are analyzed under a common set of preference assumptions, is not only logically consistent but empirically robust as well.

Keywords:   perfect deterrence theory, classical deterrence theory, war prevention, game model, war

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .