Preference Aggregation on Structured Domains: An Algorithmic Perspective
Abstract: Arrow's famous impossibility theorem (1951) states that there is no
perfect voting rule: for three or more candidates, no voting rule can
satisfy a small set of very appealing axioms. However, this is no
longer the case if we assume that voters' preferences satisfy certain
restrictions, such as being single-peaked or single-crossing. In this
talk, we discuss single-peaked and single-crossing preferences,
and survey some old and new algorithms for recognizing and
exploiting structure in voters' preferences.
Note: Edith Elkind's visit is not funded by the thematic trimester on game theory. She is an invited professor of Université Toulouse 1 Capitole.