Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Operations Research and Decisions

1 2016

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: link addition

Sortuj według:

Ogranicz wyniki do:

Power on digraphs

Peters H., Timmer J., van den Brink R.

Operations Research and Decisions

2016

Vol. 26, No. 2

107--125

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.