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.
Predicting Party Sizes: The Logic of Simple Electoral Systems

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 (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: 16 January 2021

The Number of Seat‐Winning Parties and the Largest Seat Share

The Number of Seat‐Winning Parties and the Largest Seat Share

Chapter:
(p.115) 8 The Number of Seat‐Winning Parties and the Largest Seat Share
Source:
Predicting Party Sizes
Author(s):

Rein Taagepera (Contributor Webpage)

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

The quantity to watch is the ‘seat product’ — the product of the assembly size and district magnitude. The number of parties represented in the assembly is approximately the fourth root of the seat product. The fractional seat share of the largest party is approximately the inverse of the eighth root of the seat product. This quantitatively predictive logical model agrees with the world averages. The results are approximate, because other factors are present.

Keywords:   seat product, assembly size, district magnitude, 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 .