A social choice function is a rule for choosing from a set
$D$ of objects, i.e., selecting suitable subsets of $D$.
Voting rules used in elections are the most prominent example of such
functions, which typically aggregate individual preferences (e.g., of
voters). Choice methods "symdiff" and "CKS" (currently the only
ones available) choose a given number $k$ of objects
(winners) by determining a relation $R$ minimizing
$\sum_b w_b d(R_b, R)$ over all relations for which winners are
always strictly preferred to losers, without any further constraints
on the relations between pairs of winners or pairs of losers, where
$d$ is symmetric difference (symdiff, Kemeny-Snell) or
Cook-Kress-Seiford (CKS) dissimilarity, respectively, the $R_b$
are crisp endorelations, and $w_b$ is the case weight given to
$R_b$. (Note that this is different from computing consensus
preference relations.)
Available control options include:
[object Object],[object Object]