A Recursive Measure of Voting Power that Satisfies Reasonable Postulates

05/06/2021

∙

by   Arash Abizadeh, et al.

∙

0

∙

share

We design a recursive measure of voting power based upon partial voting efficacy as well as full voting efficacy. In contrast, classical indicies and measures of voting power incorporate only partial voting efficacy. We motivate our design by representing voting games using a division lattice and via the notion of random walks in stochastic processes, and show the viability of our recursive measure by proving it satisfies a plethora of postulates that any reasonable voting measure should satisfy. These include the iso-invariance, dummy, dominance, donation, bloc, quarrel, and added blocker postulates.