A Note on the Owen Value for Glove Games

2015 ◽  
Vol 17 (04) ◽  
pp. 1550014 ◽  
Author(s):  
Julia Belau

A well-known and simple game to model markets is the glove game where worth is produced by building matching pairs. For glove games, different concepts, like the Shapley value, the component restricted Shapley value or the Owen value, yield different distributions of worth. While the Shapley value does not distinguish between productive and unproductive agents in the market and the component restricted Shapley value does not consider imbalancedness of the market, the Owen value accounts for both. As computational effort for Shapley-based allocation rules is generally high, this note provides a computationally efficient formula for the Owen value (and the component restricted Shapley value) for glove games in case of minimal winning coalitions. A comparison of the efficient formulas highlights the above-mentioned differences.

2009 ◽  
Vol 11 (04) ◽  
pp. 453-457 ◽  
Author(s):  
ANDRÉ CASAJUS

We show that the Owen value for TU games with a cooperation structure extends the Shapley value in a consistent way. In particular, the Shapley value is the expected Owen value for all symmetric distributions on the partitions of the player set. Similar extensions of the Banzhaf value do not show this property.


2021 ◽  
Vol 50 (1) ◽  
pp. 78-85
Author(s):  
Ester Livshits ◽  
Leopoldo Bertossi ◽  
Benny Kimelfeld ◽  
Moshe Sebag

Database tuples can be seen as players in the game of jointly realizing the answer to a query. Some tuples may contribute more than others to the outcome, which can be a binary value in the case of a Boolean query, a number for a numerical aggregate query, and so on. To quantify the contributions of tuples, we use the Shapley value that was introduced in cooperative game theory and has found applications in a plethora of domains. Specifically, the Shapley value of an individual tuple quantifies its contribution to the query. We investigate the applicability of the Shapley value in this setting, as well as the computational aspects of its calculation in terms of complexity, algorithms, and approximation.


2016 ◽  
Vol 80 ◽  
pp. 21-24 ◽  
Author(s):  
Koji Yokote ◽  
Yukihiko Funaki ◽  
Yoshio Kamijo

Author(s):  
SILVIU GUIASU

A solution of n-person games is proposed, based on the minimum deviation from statistical equilibrium subject to the constraints imposed by the group rationality and individual rationality. The new solution is compared with the Shapley value and von Neumann-Morgenstern's core of the game in the context of the 15-person game of passing and defeating resolutions in the UN Security Council involving five permanent members and ten nonpermanent members. A coalition classification, based on the minimum ramification cost induced by the characteristic function of the game, is also presented.


2012 ◽  
Vol 7 (2) ◽  
pp. 169-180 ◽  
Author(s):  
Victor Ginsburgh ◽  
Israël Zang

AbstractWe suggest a new game-theory-based ranking method for wines, in which the Shapley Value of each wine is computed, and wines are ranked according to their Shapley Values. Judges should find it simpler to use, since they are not required to rank order or grade all the wines, but merely to choose the group of those that they find meritorious. Our ranking method is based on the set of reasonable axioms that determine the Shapley Value as the unique solution of an underlying cooperative game. Unlike in the general case, where computing the Shapley Value could be complex, here the Shapley Value and hence the final ranking, are straightforward to compute. (JEL Classification: C71, D71, D78)


Sign in / Sign up

Export Citation Format

Share Document