Photo by pask_07 from unsplash
This paper deals with the problem of calculating the Shapley–Shubik power index in weighted majority games. We propose an efficient Monte Carlo algorithm based on an implicit hierarchical structure of… Click to show full abstract
This paper deals with the problem of calculating the Shapley–Shubik power index in weighted majority games. We propose an efficient Monte Carlo algorithm based on an implicit hierarchical structure of permutations of players. Our algorithm outputs a vector of power indices preserving the monotonicity, with respect to the voting weights. We show that our algorithm reduces the required number of samples, compared with the naive algorithm.
Keywords:
monte carlo;
shubik power;
power;
shapley shubik;
power index
Journal Title: Games
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Games
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!