User:Kristomun/Voting system philosophies: Difference between revisions

==MinmaxMinimax utility (Rawlsian justice)==

A minmaxminimax utility method attempts to choose the outcome or set of outcomes that provides the greatest benefit to the least advantaged: in utilitarian terms, that maximizes minimum utility. These methods are associated with consensus or unanimity and are in the spirit of John Rawls' [[w:A Theory of Justice|theory of justice]].

Since the minimum and maximum statistics are not robust, many of these methods are particularly vulnerable to strategy. A voter might claim that a particular candidate would be absolutely unacceptable, and thus force the method to choose someone else. However, there exist nondeterministic methods that approximate (while not exactly achieving) the minmaxminimax ideal, using randomness to deter strategy.

Typical deterministic minmaxminimax utility methods are [[Minimax approval]].

Typical nondeterministic minmaxminimax approximation methods are the Nash lottery and Maximal Partial Consensus.<ref>{{Cite journal|last=Heitzig|first=Jobst|last2=Simmons|first2=Forest W.|date=2020-06-10|title=Efficient democratic decisions via nondeterministic proportional (httpsconsensus|url=http://arxiv.org/pdfabs/2006.06548|journal=arXiv:2006.pdf)06548 [cs, econ, q-fin]}}</ref>