1998
DOI: 10.1007/bf02564802
|View full text |Cite
|
Sign up to set email alerts
|

Some new results on least square values for TU games

Abstract: TU games, value, C71,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
15
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(15 citation statements)
references
References 8 publications
0
15
0
Order By: Relevance
“…dividing the worth of the 'grand coalition' proportional to the Banzhaf values of the players) as axiomatized in van den Brink and van der Laan (1998) does not satisfy collusion neutrality nor linearity, while the additive normalization of the Banzhaf value (i.e. adding or subtracting from the Banzhaf value of every player the same amount to obtain an efficient payoff vector) as considered in Ruiz, Valenciano and Zarzuelo (1998) does not satisfy collusion neutrality nor the null player property.…”
Section: Discussionmentioning
confidence: 99%
“…dividing the worth of the 'grand coalition' proportional to the Banzhaf values of the players) as axiomatized in van den Brink and van der Laan (1998) does not satisfy collusion neutrality nor linearity, while the additive normalization of the Banzhaf value (i.e. adding or subtracting from the Banzhaf value of every player the same amount to obtain an efficient payoff vector) as considered in Ruiz, Valenciano and Zarzuelo (1998) does not satisfy collusion neutrality nor the null player property.…”
Section: Discussionmentioning
confidence: 99%
“…Lastly, we revisit the example given in Ruiz et al (1996). Next, we briefly describe how the above procedure can be generalized to the class of individually rational least square values (Ruiz et al, 1998a). A map w from {1, .…”
Section: Proposition 1 For Everymentioning
confidence: 99%
“…In case the feasible region of this optimization problem is only the set of efficient allocations, the optimal solution is called a least square value, LS w . Ruiz et al (1998a) proposed a procedure to obtain the IRLS w value quite similar to Algorithm 1. In fact, both procedures differ only in the starting point, being LS w (N, v) the initial allocation used to obtain the IRLS w value.…”
Section: Proposition 1 For Everymentioning
confidence: 99%
See 1 more Smart Citation
“…t51 (E't) ; A[aIIJPu'uonnlos :(fl ruelqord uottuznurrdo aqt raplsuoJ *uU 3ur Jolcan tq8ram e Jo sluauodruoc w pa/y\erl aq r{uru uq8ralr aqJ 'laqunu antltsod of IJ-values have been proved in [11]; among them it has been shown. as in Keane.…”
mentioning
confidence: 96%