Abstract:
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, preferences with the single-crossing property, and Euclidean preferences and their extensions. Both ordinal and dichotomous preferences are considered. For structured preferences, we present characterization in terms of forbidden subprofiles and the probability of the appearance of a profile with a given property. For group-separable preferences, we describe an algorithm for constructing a hierarchical tree. Structured preferences leading to a unique stable matching in the marriage problem are considered separately.
Fulltext:
PDF file (350 kB)