Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 28, 2017 | Accepted Version
Report Open

Strategic Manipulability is Inescapable: Gibbard-Satterthwaite without Resoluteness

Abstract

The Gibbard-Satterthwaite Theorem on the manipulability of collective-choice procedures treats only of resolute procedures. Few real or reasonable procedures are resolute. We prove a generalization of Gibbard-Satterthwaite that covers the nonresolute case. It opens harder questions than it answers about the prediction of behavior and outcomes and the design of institutions.

Additional Information

We thank Peter Ordeshook, Thomas Palfrey, Charles Plott, and Martin van Hees for helpful discussions. Schwartz thanks the UCLA Senate for research support.

Attached Files

Accepted Version - sswp817.pdf

Files

sswp817.pdf
Files (542.3 kB)
Name Size Download all
md5:e5ebfd4f606ab6736426ea233068f277
542.3 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
January 14, 2024