Voters' power in voting games with abstention: Influence relation and ordinal equivalence of power theories

被引:35
|
作者
Tchantcho, Bertrand [2 ]
Lambo, Lawrence Diffo [2 ]
Pongou, Roland [1 ]
Engoulou, Bertrand Mbama [2 ]
机构
[1] Brown Univ, Dept Econ, Providence, RI 02912 USA
[2] Univ Yaounde, Adv Teachers Training Coll, Dept Math, Yaounde, Cameroon
关键词
voting games with abstention; influence relation; equitableness; ordinal equivalence theorem;
D O I
10.1016/j.geb.2007.10.014
中图分类号
F [经济];
学科分类号
02 ;
摘要
The influence relation was introduced by Isbell [Isbell, J.R.. 1958. A class of simple games. Duke Math.. 25, 423-439] to qualitatively compare the a priori influence of voters in a simple game, which by construction allows only "yes" and "no" votes. We extend this relation to voting games with abstention (VGAs), in which abstention is permitted as an intermediate option between a "yes" and a "no" vote. Unlike in simple games, this relation is not a preorder in VGAs in general. It is not complete either, but we characterize VGAs for which it is complete, and show that it is a preorder whenever it is complete. We also compare (lie influence relation with recent generalizations to VGAs of the Shapley-Shubik and Banzhaf-Coleman power indices [Felsenthal. D.S., Machover, M., 1997. Ternary voting games. Int. J. Game Theory 26, 33535 1; Freixas, J., 2005a. The Shapley-Shubik power index for games with several levels of approval in the input and Output. Dec. Support Systems 39, 185-195; Freixas, J., 2005b. The Banzhaf index for games with several levels of approval in the input and Output. Ann. Operations Res. 137, 45-66]. For weakly equitable VGAs, the influence relation is a subset of the preorderings defined by these two power theories. We characterize VGA,; for which the three relations are equivalent. (c) 2008 Elsevier Inc. All rights reserved.
引用
收藏
页码:335 / 350
页数:16
相关论文
共 50 条
  • [41] Characterizations of two power indices for voting games with r alternatives
    Edward M. Bolger
    Social Choice and Welfare, 2002, 19 : 709 - 721
  • [42] Comparing influence theories in voting games under locally generated measures of dissatisfaction
    Lambo, L. Diffo
    Tchantcho, B.
    Moulen, J.
    INTERNATIONAL JOURNAL OF GAME THEORY, 2012, 41 (03) : 719 - 731
  • [43] Comparing influence theories in voting games under locally generated measures of dissatisfaction
    L. Diffo Lambo
    B. Tchantcho
    J. Moulen
    International Journal of Game Theory, 2012, 41 : 719 - 731
  • [44] Merging and Splitting for Power Indices in Weighted Voting Games and Network Flow Games on Hypergraphs
    Rey, Anja
    Rothe, Joerg
    STAIRS 2010: PROCEEDINGS OF THE FIFTH STARTING AI RESEARCHERS' SYMPOSIUM, 2011, 222 : 277 - 289
  • [45] 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
  • [46] 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
  • [47] A note on a natural equivalence relation on fuzzy power set
    Seselja, B
    Tepavcevic, A
    FUZZY SETS AND SYSTEMS, 2004, 148 (02) : 201 - 210
  • [48] COMPUTING POWER INDICES FOR WEIGHTED VOTING GAMES VIA DYNAMIC PROGRAMMING
    Staudacher, Jochen
    Koczy, Laszlo A.
    Stach, Izabella
    Filipp, Jan
    Kramer, Marcus
    Noffke, Till
    Olsson, Linus
    Pichler, Jonas
    Singer, Tobias
    OPERATIONS RESEARCH AND DECISIONS, 2021, 31 (02) : 123 - 145
  • [49] ANNEXATIONS AND MERGING IN WEIGHTED VOTING GAMES The Extent of Susceptibility of Power Indices
    Lasisi, Ramoni O.
    Allan, Vicki H.
    ICAART 2011: PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 2, 2011, : 124 - 133
  • [50] 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