We use cookies in order to improve the quality and usability of the HSE website. More information about the use of cookies is available here, and the regulations on processing personal data can be found here. By continuing to use the site, you hereby confirm that you have been informed of the use of cookies by the HSE website and agree with our rules for processing personal data. You may disable cookies in your browser settings.
✖A majority of the real voting rules are (or may be written as) voting with a quota (i.e. weighted game). But the axioms for the power indices defined on simple games are not directly transferred to the weighted games, because the operations used there are defined incorrectly in this case. Nevertheless, most of the axiomatics can be adapted for the weighted games. The main goal of this article is to answer the question: how to do it?
We offer a general approach to describing power indices that account for preferences as suggested by F. Aleskerov. We construct two axiomatizations of these indices. Our construction generalizes the Laruelle-Valenciano axioms for Banzhaf (Penrose) and Shapley-Shubik indices. We obtain new sets of axioms for these indices, in particular, sets without the anonymity axiom.
