A survey of papers on practically significant restrictions on the preference profile of a
collective is carried out, including single-peaked preferences, group-separable preferences …

We analyze how numerical experiments regarding elections were conducted within the
computational social choice literature (focusing on papers published in the IJCAI, AAAI, and …

A preference profile is single-peaked on a tree if the candidate set can be equipped with a
tree structure so that the preferences of each voter are decreasing from their top candidate …

We study in this paper single-peakedness on arbitrary graphs. Given a collection of
preferences (rankings of alternatives), we aim at determining a connected graph G on which …

We consider the setting where the members of a society (voters) have preferences over
candidates, and the candidates can be ordered on an axis so that the voters' preferences …

This thesis studies structural and algorithmic aspects of preference domain restrictions,
namely single-peaked preferences and Euclidean preferences. In the first part of the thesis …

In this thesis we discuss the complexity of election control problems under restricted
preference domains. We analyze a wide spectrum of settings, a number of different voting …

We study in this paper single-peakedness on arbitrary graphs. Given a collection of
preferences (rankings of alternatives), we aim at determining a connected graph G on which …

Проведен обзор работ по практически значимым ограничениям на профиль
предпочтений коллектива: однопиковые предпочтения, сепарабельные предпочтения …