Voting theory is the study of methods for conducting elections. In this tutorial, we will present some of the most important voting rules and review their properties; we will discuss the problem of strategic manipulation in some depth (including the famous Gibbard-Satterthwaite Theorem); and we will briefly introduce the emerging field of computational social choice, which seeks to integrate ideas from social choice theory (including voting theory) and computer science.
I have previosuly taught an extended variant of this tutorial at AAAI-2010. For much more material, see my course on computational social choice, given annually at the ILLC.
Visit the COMSOC website to find out about the COMSOC workshops and related events, to browse through a list of PhD theses in the field, and to join the mailing list.