Preface |
|
ix | |
PART ONE |
|
|
1 An Introduction to Social Choice Theory |
|
|
3 | (34) |
|
1.1 Some Intuitions, Terminology, and an Example |
|
|
3 | (6) |
|
|
9 | (4) |
|
|
13 | (7) |
|
|
20 | (9) |
|
|
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) |
|
|
56 | (4) |
|
|
60 | (21) |
|
3.1 The Gibbard-Satterthwaite Theorem |
|
|
60 | (8) |
|
|
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) |
|
|
77 | (4) |
PART TWO |
|
|
4 Non-Resolute Voting Rules |
|
|
81 | (21) |
|
4.1 The Duggan-Schwartz Theorem |
|
|
81 | (6) |
|
|
87 | (1) |
|
|
88 | (7) |
|
4.4 Expected Utility Results |
|
|
95 | (7) |
|
5 Social Choice Functions |
|
|
102 | (16) |
|
5.1 The Barberá-Kelly Theorem |
|
|
102 | (7) |
|
|
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) |
|
|
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) |
|
|
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 | |