On the Shapley value and its application to the Italian VQR research assessment exercise

2019 ◽  
Vol 13 (1) ◽  
pp. 87-104 ◽  
Author(s):  
Camil Demetrescu ◽  
Francesco Lupia ◽  
Angelo Mendicelli ◽  
Andrea Ribichini ◽  
Francesco Scarcello ◽  
...  
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

2009 ◽  
Vol 41 (4) ◽  
pp. 199-207 ◽  
Author(s):  
David Ashton ◽  
Vivien Beattie ◽  
Jane Broadbent ◽  
Chris Brooks ◽  
Paul Draper ◽  
...  

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.


Sign in / Sign up

Export Citation Format

Share Document