COMPUTING POWER INDICES FOR WEIGHTED VOTING GAMES VIA DYNAMIC PROGRAMMING

被引:6
|
作者
Staudacher, Jochen [1 ]
Koczy, Laszlo A. [2 ,3 ]
Stach, Izabella [4 ]
Filipp, Jan [1 ]
Kramer, Marcus [1 ]
Noffke, Till [1 ]
Olsson, Linus [1 ]
Pichler, Jonas [1 ]
Singer, Tobias [1 ]
机构
[1] Hsch Kempten, Fak Informat, Bahnhofstr 61, D-87435 Kempten, Germany
[2] Ctr Econ & Reg Studies, Inst Econ, Toth Kalman U 4, H-1097 Budapest, Hungary
[3] Budapest Univ Technol & Econ, Dept Finance, Magyar Tudosok Korutja 2, H-1112 Budapest, Hungary
[4] AGH Univ Sci & Technol, Al Mickiewicza 30, PL-30059 Krakow, Poland
关键词
cooperative game theory; power indices; weighted voting games; dynamic programming; minimal winning coalitions;
D O I
10.37190/ord210206
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We study the efficient computation of power indices for weighted voting games using the paradigm of dynamic programming. We survey the state-of-the-art algorithms for computing the Banzhaf and Shapley-Shubik indices and point out how these approaches carry over to related power indices. Within a unified framework, we present new efficient algorithms for the Public Good index and a recently proposed power index based on minimal winning coalitions of the smallest size, as well as a very first method for computing the Johnston indices for weighted voting games efficiently. We introduce a software package providing fast C++ implementations of all the power indices mentioned in this article, discuss computing times, as well as storage requirements.
引用
收藏
页码:123 / 145
页数:23
相关论文
共 50 条
  • [21] Microarray Data Analysis via Weighted Indices and Weighted Majority Games
    Lucchetti, Roberto
    Radrizzani, Paola
    COMPUTATIONAL INTELLIGENCE METHODS FOR BIOINFORMATICS AND BIOSTATISTICS, 2010, 6160 : 179 - 190
  • [22] The Cost of Principles: Analyzing Power in Compatibility Weighted Voting Games
    See, Abigail
    Bachrach, Yoram
    Kohli, Pushmeet
    AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2014, : 37 - 44
  • [23] Efficient Computation of Power Indices for Weighted Majority Games
    Uno, Takeaki
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 679 - 689
  • [24] Reliability Weighted Voting Games
    Bachrach, Yoram
    Shah, Nisarg
    ALGORITHMIC GAME THEORY, SAGT 2013, 2013, 8146 : 38 - 49
  • [25] Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
    Josep Freixas
    Sascha Kurz
    Annals of Operations Research, 2014, 222 : 317 - 339
  • [26] Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
    Freixas, Josep
    Kurz, Sascha
    ANNALS OF OPERATIONS RESEARCH, 2014, 222 (01) : 317 - 339
  • [27] A survey of algorithms for calculating power indices of weighted majority games
    Matsui, T
    Matsui, Y
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2000, 43 (01) : 71 - 86
  • [28] Analyzing Power in Weighted Voting Games with Super-Increasing Weights
    Yuval Filmus
    Joel Oren
    Yair Zick
    Yoram Bachrach
    Theory of Computing Systems, 2019, 63 : 150 - 174
  • [29] The Power Index at Infinity: Weighted Voting in Sequential Infinite Anonymous Games
    Eid, Shereif
    ICAART: PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE - VOL 2, 2021, : 475 - 482
  • [30] Mergeable weighted majority games and characterizations of some power indices
    Armijos-Toro, Livino M.
    Alonso-Meijide, Jose M.
    Mosquera, Manuel A.
    ANNALS OF OPERATIONS RESEARCH, 2024, 336 (03) : 1373 - 1393