Connecting preferences over a set with preferences over its power set, and conversely

GZ - Psychologie · Springer Nature · 2026-07-06 · DOI: 10.1007/s10203-026-00590-9

Аннотация

In this note we review some recent results concerning two related problems: how to build, starting from a ranking over a finite set A of alternatives, a compatible extension to a ranking over all subsets of A ; and, conversely, how to derive a ranking over the alternatives from a ranking over the subsets of a set of alternatives. These two problems are studied in Social Choice because of their wide range of applications. The reported results are taken from Lucchetti et al. (2015); Bernardi et al. (2019).

Читать у издателя →

Похожие статьи