The term was coined in 1995 by Burt L. Monroe,[1] but a similar idea appeared already in 1983 in a paper by John R. Chamberlin and Paul N.
The main difference is as follows: Both rules aim to maximize a global measure of satisfaction, which is based on individual preferences.
Betzler, Slinko and Uhlmann[3] investigate the parameterized complexity of winner determination of the dissatisfaction-based variants: they prove fixed-parameter tractability for the parameter "number of candidates", but fixed-parameter intractability for "number of winners".
Some problems become easier for restricted preference domains: Lu and Boutilier[6] presented a polytime 0.63-factor approximation greedy algorithm for the optimal satisfaction of the CC rule.
Experiments on real-life preference-aggregation data shows that these fast algorithms in many cases find near-perfect solutions.