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.
This article is an output of a research project implemented as part of the Basic Research Program
at the National Research University Higher School of Economics (HSE University).
Citation:
A. V. Karpov, “Structured preferences: a literature survey”, Avtomat. i Telemekh., 2022, no. 9, 3–35; Autom. Remote Control, 83:9 (2022), 1329–1354
\Bibitem{Kar22}
\by A.~V.~Karpov
\paper Structured preferences: a literature survey
\jour Avtomat. i Telemekh.
\yr 2022
\issue 9
\pages 3--35
\mathnet{http://mi.mathnet.ru/at15755}
\crossref{https://doi.org/10.31857/S000523102209001X}
\edn{https://elibrary.ru/AIIVES}
\transl
\jour Autom. Remote Control
\yr 2022
\vol 83
\issue 9
\pages 1329--1354
\crossref{https://doi.org/10.1134/S0005117922090016}
Linking options:
https://www.mathnet.ru/eng/at15755
https://www.mathnet.ru/eng/at/y2022/i9/p3
This publication is cited in the following 8 articles:
Bei Zhou, Søren Riis, “An efficient heuristic search algorithm for discovering large Condorcet domains”, 4OR-Q J Oper Res, 2025
Alexander Karpov, Klas Markström, Søren Riis, Bei Zhou, “Coherent domains and improved lower bounds for the maximum size of Condorcet domains”, Discrete Applied Mathematics, 370 (2025), 57
Charles Leedham-Green, Klas Markström, Søren Riis, “The largest Condorcet domain on 8 alternatives”, Soc Choice Welf, 62:1 (2024), 109
Yongjie Yang, Dinko Dimitrov, “Group control for procedural rules: parameterized complexity and consecutive domains”, Front. Comput. Sci., 18:3 (2024)
Clemens Puppe, Arkadii Slinko, “Maximal Condorcet domains. A further progress report”, Games and Economic Behavior, 145 (2024), 426
Bei Zhou, Klas Markström, Søren Riis, “CDL: A fast and flexible library for the study of permutation sets with structural restrictions”, SoftwareX, 28 (2024), 101951
Alexander Karpov, “Structure of single-peaked preferences”, Journal of Mathematical Psychology, 117 (2023), 102817
Alexander Karpov, Springer Optimization and Its Applications, 202, Data Analysis and Optimization, 2023, 169