1 problem

For $n\ge 2$, let $[n]=\{1,\ldots,n\}$ be a set of alternatives. For each linear ranking $\pi=(\pi(1),\ldots,\pi(n))$ of $[n]$, define its deterministic best-worst choice vector…