Ebook: Social choice and the mathematics of manipulation

"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."--BOOK JACKET.  Read more... 1. An introduction to social choice theory -- 2. An introduction to manipulability -- 3. Resolute voting rules -- 4. Non-resolute voting rules -- 5. Social choice functions -- 6. Ultrafilters and the infinite -- 7. More on resolute procedures -- 8. More on non-resolute procedures -- 9. Other election-theoretic contexts