Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games

01/08/2021
by   Yuto Ushioda, et al.
0

This paper addresses Monte Carlo algorithms for calculating the Shapley-Shubik power index in weighted majority games. First, we analyze a naive Monte Carlo algorithm and discuss the required number of samples. We then propose an efficient Monte Carlo algorithm and show that our algorithm reduces the required number of samples as compared to the naive algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/16/2018

MoCaNA, un agent de négociation automatique utilisant la recherche arborescente de Monte-Carlo

Automated negotiation is a rising topic in Artificial Intelligence resea...
research
03/29/2023

A Monte-Carlo ab-initio algorithm for the multiscale simulation of compressible multiphase flows

We propose a novel Monte-Carlo based ab-initio algorithm for directly co...
research
01/26/2019

Eficient Monte Carlo Simulation of the Left Tail of Positive Gaussian Quadratic Forms

Estimating the left tail of quadratic forms in Gaussian random vectors i...
research
03/12/2013

Toward Optimal Stratification for Stratified Monte-Carlo Integration

We consider the problem of adaptive stratified sampling for Monte Carlo ...
research
12/31/2019

Monte Carlo Techniques for Approximating the Myerson Value – Theoretical and Empirical Analysis

Myerson first introduced graph-restricted games in order to model the in...
research
10/05/2021

Deep Synoptic Monte Carlo Planning in Reconnaissance Blind Chess

This paper introduces deep synoptic Monte Carlo planning (DSMCP) for lar...
research
01/18/2019

An Efficient Monte Carlo-based Probabilistic Time-Dependent Routing Calculation Targeting a Server-Side Car Navigation System

Incorporating speed probability distribution to the computation of the r...

Please sign up or login with your details

Forgot password? Click here to reset