Jump to ContentJump to Main Navigation
Predicting Party SizesThe Logic of Simple Electoral Systems$
Users without a subscription are not able to see the full content.

Rein Taagepera

Print publication date: 2007

Print ISBN-13: 9780199287741

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780199287741.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 24 July 2019

The Mean Duration of Cabinets

The Mean Duration of Cabinets

Chapter:
(p.165) 10 The Mean Duration of Cabinets
Source:
Predicting Party Sizes
Author(s):

Rein Taagepera (Contributor Webpage)

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199287741.003.0010

Again the quantity to watch is the ‘seat product’. The inverse square law of cabinet durations says that the mean cabinet duration in a country is approximately forty-two years divided by the square of the effective number of parties. In institutional terms, mean cabinet duration is approximately the inverse of the cube root of the seat product. This quantitatively predictive logical model agrees with the world averages. The results are approximate, because other factors enter.

Keywords:   inverse square law, cabinet durations, seat product, assembly size, district magnitude, effective number of parties, quantitatively predictive logical model

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 .