Sequential Voting Procedures in Symmetric Binary Elections
We explore sequential voting in symmetric two-option environments. We show that the (informative) symmetric equilibria of the simultaneous voting game are also equilibria in any sequential voting structure. In unanimity games, (essentially) the whole set of equilibria is the same in all sequential structures. We also explore the relationship between simultaneous and sequential voting in other contexts. We illustrate several instances where sequential voting does no better at aggregating information than simultaneous voting. The inability of the sequential structure to use additional information in voting models is distinct from that in the herd-cascade literature.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:ucp:jpolec:v:108:y:2001:i:1:p:34-55. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Journals Division)
If references are entirely missing, you can add them using this form.