The Shapley Value for Differential Games

Author(s):  
Leon A. Petrosjan
2020 ◽  
Vol 12 (4) ◽  
pp. 93-111
Author(s):  
Анна Тур ◽  
Anna Tur ◽  
Леон Аганесович Петросян ◽  
Leon Petrosyan

The paper describes a class of differential games on networks. The construction of cooperative optimality principles using a special type of characteristic function that takes into account the network structure of the game is investigated. The core, the Shapley value and the tau-value are used as cooperative optimality principles. The results are demonstrated on a model of a differential research investment game, where the Shapley value and the tau-value are explicitly constructed.


2020 ◽  
Vol 13 ◽  
pp. 244-251
Author(s):  
Ildus Kuchkarov ◽  

In the paper the class of linear quadratic cooperative differential games with continuous updating is considered. Here the case of feedback based strategies is used to construct cooperative strategies with continuous updating. Characteristic function with continuous updating, cooperative trajectory with continuous updating and cooperative solution are constructed. For the cooperative solution we use the Shapley value.


Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 755
Author(s):  
Anna Tur ◽  
Leon Petrosyan

One class of cooperative differential games on networks is considered. It is assumed that interaction on the network is possible not only between neighboring players, but also between players connected by paths. Various cooperative optimality principles and their properties for such games are investigated. The construction of the characteristic function is proposed, taking into account the network structure of the game and the ability of players to cut off connections. The conditions under which a strong time-consistent subcore is not empty are studied. The formula for explicit calculation of the Shapley value is derived. The results are illustrated by the example of one differential marketing game.


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

Sign in / Sign up

Export Citation Format

Share Document