Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

PL EN


2016 | 26 | 2 | 107-125

Article title

Power on digraphs

Content

Title variants

Languages of publication

EN

Abstracts

EN
It is assumed that relations between n players are represented by a directed graph or digraph. Such a digraph is called invariant if there is a link (arc) between any two players between whom there is also a directed path. We characterize a class of power indices for invariant digraphs based on four axioms: Null player, Constant sum, Anonymity, and the Transfer property. This class is determined by 2n – 2 parameters. By considering additional conditions about the effect of adding a directed link between two players, we single out three different, one-parameter families of power indices, reflecting several well- -known indices from the literature: the Copeland score, - and apex type indices.

Year

Volume

26

Issue

2

Pages

107-125

Physical description

Contributors

author
  • Department of Quantitative Economics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands,
author
  • Stochastic Operations Research, Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
  • Department of Econometrics, Free University of Amsterdam, P.O. Box 15867, 1001 NJ Amsterdam, The Netherlands

References

  • BERTINI C., FREIXAS J., GAMBARELLI G., STACH I., Comparing power indices, [in:] V. Fragnelli, G. Gambarelli (Eds.), Open Problems in the Theory of Cooperative Games, Special Issue of Interna-tional Game Theory Review, 2013, 15 (2), 1320004.
  • COPELAND A.H., A reasonable social welfare function, Seminar on Applications of Mathematics to the Social Sciences, University of Michigan, 1951.
  • DUBEY P., On the uniqueness of the Shapley value, International Journal of Game Theory, 1975, 4, 131.
  • DUBEY P., EINY E., HAIMANKO O., Compound voting and the Banzhaf index, Games and Economic Behavior, 2005, 51, 20.
  • EINY E., HAIMANKO O., Characterization of the Shapley–Shubik power index without the efficiency axiom, Games and Economic Behavior, 2011, 73, 615.
  • GAMBARELLI G., Power indices for political and financial decision making, Annals of Operations Research, 1994, 51, 163.
  • GAMBARELLI G., OWEN G., Indirect control of corporations, International Journal of Game Theory, 1994, 23, 287.
  • GAMBARELLI G., STACH I., Power indices in politics, some results and open problems, Homo Oeconomics, 2009, 26, 417.
  • GILLES R.P., OWEN G., VAN DEN BRINK R., Games with permission structures, the conjunctive approach, International Journal of Game Theory, 1992, 20, 277.
  • HU X., SHAPLEY L.S., On authority distributions in organizations, equilibrium, Games and Economic Behavior, 2003, 45, 132.
  • HU X., SHAPLEY L.S., On authority distributions in organizations, controls, Games and Economic Behavior, 2003, 45, 153.
  • KAROS D., PETERS H., Indirect control and power in mutual control structures, Games and Economic Behavior, 2015, 92, 150.
  • MYERSON R.B., Graphs and Cooperation in Games, Mathematics of Operations Research, 1977, 2, 225.
  • SHAPLEY L.S., A value for n-person games, [in:] H.W. Kuhn, A.W. Tucker (Eds.), Contributions to the Theory of Games II, Princeton University Press, Princeton 1953.
  • SHAPLEY L.S., SHUBIK M., A method for evaluating the distribution of power in a committee system, American Political Science Review, 1954, 48, 787.
  • VAN DEN BRINK R., The Apex power measure for directed networks, Social Choice and Welfare, 2002, 19, 845.
  • VAN DEN BRINK R., BORM P., Digraph competitions and cooperative games, Theory and Decision, 2002, 53, 327.
  • VAN DEN BRINK R., GILLES R., Measuring domination in directed networks, Social Networks, 2000, 22, 141.

Document Type

Publication order reference

Identifiers

YADDA identifier

bwmeta1.element.desklight-44d6b5ca-6e35-45c2-94ce-a88fa6752366
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.