1. Brandt F, Conitzer V, Endriss U, Lang J, Procaccia A (eds) (2016) Handbook of computational social choice. Cambridge University Press, Cambridge
2. Caragiannis I, Kaklamanis C, Karanikolas N, Procaccia A (2014) Socially desirable approximations for Dodgson’s voting rule. ACM Trans Algorithms 10:6
3. Dodgson C (1876) Reprint of “A method of taking votes on more than two issues”. In: McLean I, Urken A (eds) Classics of social choice. The University of Michigan Press (reprinted in 1995)
4. Fellows M, Jansen BMP, Lokshtanov D, Rosamond FA, Saurabh S (2010) Determining the winner of a Dodgson election is hard. In: IARCS annual conference on foundations of software technology and theoretical computer science, Schloss Dagstuhl-LZI, Leibniz international Proceedings in informatics (LIPIcs), vol 8, pp 459–468
5. Gehrlein WV (1999) Approximating the probability that a condorcet winner exists. In: Proceedings of the National Decision Sciences Institute, pp 626–628