Shapley-Shubik功率指数的蒙特卡罗方法

Simulation & games Pub Date : 2022-06-02 DOI:10.3390/g13030044

Yuto Ushioda, Masato Tanaka, Tomomi Matsui

{"title":"Shapley-Shubik功率指数的蒙特卡罗方法","authors":"Yuto Ushioda, Masato Tanaka, Tomomi Matsui","doi":"10.3390/g13030044","DOIUrl":null,"url":null,"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.","PeriodicalId":85522,"journal":{"name":"Simulation & games","volume":"57 1","pages":"44"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Monte Carlo Methods for the Shapley-Shubik Power Index\",\"authors\":\"Yuto Ushioda, Masato Tanaka, Tomomi Matsui\",\"doi\":\"10.3390/g13030044\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":85522,\"journal\":{\"name\":\"Simulation & games\",\"volume\":\"57 1\",\"pages\":\"44\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Simulation & games\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3390/g13030044\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Simulation & games","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/g13030044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了加权多数对策中Shapley-Shubik幂指数的计算问题。我们提出了一种基于玩家排列的隐式层次结构的高效蒙特卡罗算法。我们的算法输出一个幂指数向量，保持相对于投票权重的单调性。我们表明，与朴素算法相比，我们的算法减少了所需的样本数量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Monte Carlo Methods for the Shapley-Shubik Power Index

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Simulation & games

自引率

0.00%

发文量