Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T17:13:31.258Z Has data issue: false hasContentIssue false

In Search of the Uncovered Set

Published online by Cambridge University Press:  04 January 2017

Nicholas R. Miller*
Affiliation:
Department of Political Science, University of Maryland Baltimore County, 1000 Hilltop Circle, Baltimore, MD 21250. e-mail: nmiller@umbc.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper pursues a number of theoretical explorations and conjectures pertaining to the uncovered set in spatial voting games. It was stimulated by the article “The Uncovered Set and the Limits of Legislative Action” by W. T. Bianco, I. Jeliazkov, and I. Sened (2004, Political Analysis 12:256—78) that employed a grid-search computational algorithm for estimating the size, shape, and location of the uncovered set, and it has been greatly facilitated by access to the CyberSenate spatial voting software being developed by Joseph Godfrey. I bring to light theoretical considerations that account for important features of the Bianco, Jeliazkov, and Sened results (e.g., the straight-line boundaries of uncovered sets displayed in some of their figures, the “unexpectedly large” uncovered sets displayed in other figures, and the apparent sensitivity of the location of uncovered sets to small shifts in the relative sizes of party caucuses) and present theoretical insights of more general relevance to spatial voting theory.

Information

Type
Research Article
Copyright
Copyright © The Author 2006. Published by Oxford University Press on behalf of the Society for Political Methodology