Social Choice and the Mathematics of Manipulation

by
Format: Hardcover
Pub. Date: 2005-05-09
Publisher(s): Cambridge University Press
List Price: $133.00

Buy New

Usually Ships in 8 - 10 Business Days.
$132.87

Rent Textbook

Select for Price
There was a problem. Please try again later.

Rent Digital

Rent Digital Options
Online:1825 Days access
Downloadable:Lifetime Access
$55.19
*To support the delivery of the digital material to you, a digital delivery fee of $3.99 will be charged on each digital item.
$55.19*

Used Textbook

We're Sorry
Sold Out

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

Honesty in voting, it turns out, is not always the best policy. Indeed, in the early 1970s, Allan Gibbard and Mark Satterthwaite, building on the seminal work of Nobel laureate Kenneth Arrow, proved that with three or more alternatives there is no reasonable voting system that is non-manipulable; voters will always have an opportunity to benefit by submitting a disingenuous ballot. The ensuing decades produced a number of theorems of striking mathematical naturality that dealt with the manipulability of voting systems. This book presents many of these results from the last quarter of the twentieth century, especially the contributions of economists and philosophers, from a mathematical point of view, with many new proofs. The presentation is almost completely self-contained, and requires no prerequisites except a willingness to follow rigorous mathematical arguments. Mathematics students, as well as mathematicians, political scientists, economists and philosophers will learn why it is impossible to devise a completely unmanipulable voting system.

Table of Contents

Preface ix
PART ONE
1 An Introduction to Social Choice Theory
3(34)
1.1 Some Intuitions, Terminology, and an Example
3(6)
1.2 A Little History
9(4)
1.3 Arrow's Theorem
13(7)
1.4 Twenty Voting Rules
20(9)
1.5 Exercises
29(8)
2 An Introduction to Manipulability
37(23)
2.1 Set Preferences and Manipulability
37(7)
2.2 Specific Examples of Manipulation
44(7)
2.3 Summary of the Main Results
51(2)
2.4 Agenda Manipulability and Transitive Rationality
53(3)
2.5 Exercises
56(4)
3 Resolute Voting Rules
60(21)
3.1 The Gibbard-Satterthwaite Theorem
60(8)
3.2 Ties in the Ballots
68(1)
3.3 The Equivalence of Arrow's Theorem and the Gibbard-Satterthwaite Theorem
69(3)
3.4 Reflections on the Proof of the Gibbard-Satterthwaite Theorem
72(5)
3.5 Exercises
77(4)
PART TWO
4 Non-Resolute Voting Rules
81(21)
4.1 The Duggan-Schwartz Theorem
81(6)
4.2 Ties in the Ballots
87(1)
4.3 Feldman's Theorem
88(7)
4.4 Expected Utility Results
95(7)
5 Social Choice Functions
102(16)
5.1 The Barberá-Kelly Theorem
102(7)
5.2 Ties in the Ballots
109(1)
5.3 Another Barberá Theorem
110(3)
5.4 The Maclntyre-Pattanaik Theorem
113(5)
6 Ultrafilters and the Infinite
118(15)
6.1 The Infinite Version of Arrow's Theorem
118(4)
6.2 Infinite Gibbard-Satterthwaite without Invisible Dictators
122(1)
6.3 Invisible Dictators Resurrected
123(2)
6.4 Infinitely Many Voters and Infinitely Many Alternatives
125(8)
PART THREE
7 More on Resolute Procedures
133(14)
7.1 Combinatorial Equivalents
133(3)
7.2 Characterization Theorems for Resolute Voting Rules
136(4)
7.3 Characterization Theorems for Resolute Social Choice Functions
140(2)
7.4 Characterizations for Resolute Social Welfare Functions
142(5)
8 More on Non-Resolute Procedures
147(13)
8.1 Gärdenfors' Theorem
147(5)
8.2 Characterization Theorems for Non-Resolute Voting Rules
152(2)
8.3 Another Feldman Theorem
154(3)
8.4 Characterization Theorems for Non-Resolute Social Choice Functions
157(3)
9 Other Election-Theoretic Contexts
160(7)
9.1 Introduction
160(1)
9.2 Ballots That Are Sets: Approval Voting and Quota Systems
160(3)
9.3 The Barberá-Sonnenschein-Zhou Theorem
163(1)
9.4 Outcomes That Are Probabilistic Vectors: Gibbard's Theorem
164(3)
References 167(6)
Index 173

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.