Handbook of Computational Social Choice (Hardcover)

Foreword Herve Moulin; 1. Introduction to computational social choice Felix Brandt, Vincent Conitzer, Ulle Endriss, Jerome Lang and Ariel D. Procaccia; Part I. Voting: 2. Introduction to the theory of voting William S. Zwicker; 3. Tournament solutions Felix Brandt, Markus Brill and Paul Harrenstein; 4. Weighted tournament solutions Felix Fischer, Olivier Hudry and Rolf Niedermeier; 5. Dodgson's rule and Young's rule Ioannis Caragiannis, Edith Hemaspaandra and Lane A. Hemaspaandra; 6. Barriers to manipulation in voting Vincent Conitzer and Toby Walsh; 7. Control and bribery in voting Piotr Faliszewski and Jorg Rothe; 8. Rationalizations of voting rules Edith Elkind and Arkadii Slinko; 9. Voting in combinatorial domains Jerome Lang and Lirong Xia; 10. Incomplete information and communication in voting Craig Boutilier and Jeffrey S. Rosenschein; Part II. Fair Allocation: 11. Introduction to the theory of fair allocation William Thomson; 12. Fair allocation of indivisible goods Sylvain Bouveret, Yann Chevaleyre and Nicolas Maudet; 13. Cake cutting algorithms Ariel D. Procaccia; Part III. Coalition Formation: 14. Matching under preferences Bettina Klaus, David F. Manlove and Francesca Rossi; 15. Hedonic games Haris Aziz and Rahul Savani; 16. Weighted voting games Georgios Chalkiadakis and Michael Wooldridge; Part IV. Additional Topics: 17. Judgment aggregation Ulle Endriss; 18. The axiomatic approach and the internet Moshe Tennenholtz and Aviv Zohar; 19. Knockout tournaments Virginia Vassilevska-Williams.