This mini-course covers basics of social choice theory. We will discuss popular preference aggregation rules, axioms, famous impossibility results, such as Arrow’s theorem and Gibbard-Satterthwaite theorem, and ways to circumvent them, such as restricted preference domains. We will also discuss the computational complexity of the rules we consider, as well as that of strategic behavior under these rules.
Computational social choice
Prof. Edith Elkind
17 July 2023
2:15 pm - 5:00 pm
This event is part of the Safe and Trusted AI Summer School 2023. The Summer School is core for STAI CDT PhD students, and open to a limited number of other students, by invitation.
About the speaker
Prof. Edith Elkind is a Professor of Computer Science in the University of Oxford Computer Science Department. Prior to to Oxford she was an Assistant Professor at Nanyang Technological University (Singapore), where her research was supported by the National Research foundation (NRF) Fellowship. Dr. Elkind obtained her PhD from Princeton University in 2005, and was a postdoctoral research fellow at the University of Warwick, University of Liverpool and Hebrew University of Jerusalem, as well as a lecturer (Roberts Fellow) at University of Southampton. Dr Elkind’s main interests are: Algorithmic game theory, computational social choice.