Preference Restrictions in Computational Social Choice: Recent Progress.

The goal of this short paper is to provide an overview of recent progress in understanding and exploiting useful properties of restricted preference domains, such as, e.g., the domains of single-peaked, single-crossing and 1-Euclidean preferences.