Multiple Ideal Points: Revealed Preferences in Different Domains
Abstract We extend classical ideal point estimation to allow voters to have different preferences when voting in different domains—for example, when voting on agricultural policy than when voting on defense policy. Our scaling procedure results in estimated ideal points on a common scale. As a result, we are able to directly compare a member’s revealed preferences across different domains of voting (different sets of motions) to assess if, for example, a member votes more conservatively on agriculture motions than on defense. In doing so, we are able to assess the extent to which voting behavior of an individual voter is consistent with a uni-dimensional spatial model—if a member has the same preferences in all domains. The key novelty is to estimate rather than assume the identity of “stayers”—voters whose revealed preference is constant across votes. Our approach offers methodology for investigating the relationship between the basic space and issue space in legislative voting (Poole 2007). There are several methodological advantages to our approach. First, our model allows for testing sharp hypotheses. Second, the methodology developed can be understood as a kind of partial-pooling model for item response theory scaling, resulting in less uncertainty of estimates. Related, our estimation method provides more »
Authors:
; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10301106
Journal Name:
Political Analysis
Volume:
29
Issue:
2
Page Range or eLocation-ID:
139 to 166
ISSN:
1047-1987
2. We solve a long-standing challenge to the integrity of votes cast without the supervision of a voting booth: {\it improper influence},'' which typically refers to any combination of vote buying and voter coercion. Our approach allows each voter, or their trusted agents (which we call {\it hedgehogs}''), to {\it nullify''} (effectively cancel) their vote in a way that is unstoppable, irrevocable, and forever unattributable to the voter. In particular, our approach enhances security of online, remote, public-sector elections, for which there is a growing need and the threat of improper influence is most acute. We introduce the new approach, give detailed cryptographic protocols, show how it can be applied to several voting settings, and describe our implementation. The protocols compose a full voting system, which we call {\it {\votexx}}, including registration, voting, nullification, and tallying---using an anonymous communication system for registration, vote casting, and other communication in the system. We demonstrate how the technique can be applied to known systems, including where ballots can be mailed to voters and voters use codes on the ballot to cast their votes online. In comparison with previous proposals, our system makes fewer assumptions and protects against a strong adversary who learns all ofmore »