Trade with Technology Spillover: A Dynamic Network Game Analysis

2020 ◽  
pp. 2050011
Author(s):  
David W. K. Yeung ◽  
Leon A. Petrosyan ◽  
Yingxuan Zhang
Keyword(s):  
Shapley Value ◽  
General Class ◽  
Dynamic Network ◽  
Technology Spillover ◽  
Network Games ◽  
Game Analysis ◽  
The Shapley Value ◽  
Positive Externalities ◽  
Network Game ◽  
Representative Model

This paper presents a general class of dynamic network games to analyze trade with technology spillover. Due to the fact that the benefits of technology spillover are not fully accrued to the technology developer, the positive externalities are under-exploited. The cooperative solution yields an optimal outcome. To reflect the contributions of individual agents to the network, the Shapley value is used as a solution optimality principle in sharing the cooperative gains. A time-consistent payoff imputation procedure is derived to maintain the Shapley value at each stage of the cooperation. A representative model based on the general class of network games with explicit functional form is given. This is the first time that trade with technology spillover is studied in the framework of dynamic network games, further studies along this line are expected.

scholarly journals Non-Zero Sum Network Games with Pairwise Interactions

2021 ◽  
Vol 14 ◽  
pp. 38-48
Author(s):  
Mariia A. Bulgakova ◽  
Keyword(s):  
Shapley Value ◽  
Network Formation ◽  
Network Games ◽  
Zero Sum Games ◽  
Pairwise Interactions ◽  
Formation Stage ◽  
The Shapley Value ◽  
Cooperative Solutions ◽  
Zero Sum ◽  
Network Form

In the paper non-zero sum games on networks with pairwise interactions are investigated. The first stage is network formation stage, where players chose their preferable set of neighbours. In all following stages simultaneous non-zero sum game appears between connected players in network. As cooperative solutions the Shapley value and τ -value are considered. Due to a construction of characteristic function both formulas are simpli ed. It is proved, that the coeffcient λ in τ -value is independent from network form and number of players or neighbours and is equal to 1/2 . Also it is proved that in this type of games on complete network the Shapley value and τ -value are coincide.

Multiplayer Allocations in the Presence of Diminishing Marginal Contributions: Cooperative Game Analysis and Applications in Management Science

2020 ◽  
Author(s):  
Mingming Leng ◽  
Chunlin Luo ◽  
Liping Liang
Keyword(s):  
Cooperative Game ◽  
Shapley Value ◽  
Extreme Points ◽  
Game Analysis ◽  
The Core ◽  
The Shapley Value ◽  
Code Sharing ◽  
Marginal Contributions ◽  
Least Core ◽  
Necessary And Sufficient

We use cooperative game theory to investigate multiplayer allocation problems under the almost diminishing marginal contributions (ADMC) property. This property indicates that a player’s marginal contribution to a non-empty coalition decreases as the size of the coalition increases. We develop ADMC games for such problems and derive a necessary and sufficient condition for the non-emptiness of the core. When the core is non-empty, at least one extreme point exists, and the maximum number of extreme points is the total number of players. The Shapley value may not be in the core, which depends on the gap of each coalition. A player can receive a higher allocation based on the Shapley value in the core than based on the nucleolus, if the gap of the player is no greater than the gap of the complementary coalition. We also investigate the least core value for ADMC games with an empty core. To illustrate the applications of our results, we analyze a code-sharing game, a group buying game, and a scheduling profit game. This paper was accepted by Chung Piaw Teo, optimization.

Query Games in Databases

2021 ◽  
Vol 50 (1) ◽  
pp. 78-85
Author(s):  
Ester Livshits ◽  
Leopoldo Bertossi ◽  
Benny Kimelfeld ◽  
Moshe Sebag
Keyword(s):  
Game Theory ◽  
Cooperative Game ◽  
Shapley Value ◽  
Cooperative Game Theory ◽  
The Shapley Value ◽  
Computational Aspects ◽  
Aggregate Query ◽  
Boolean Query

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.

scholarly journals A new basis and the Shapley value

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

COPING WITH UNCERTAINTY IN n-PERSON GAMES

2000 ◽  
Vol 08 (05) ◽  
pp. 503-523 ◽  
Author(s):  
SILVIU GUIASU
Keyword(s):  
Characteristic Function ◽  
Security Council ◽  
Shapley Value ◽  
Statistical Equilibrium ◽  
Individual Rationality ◽  
Von Neumann ◽  
Minimum Deviation ◽  
The Shapley Value ◽  
Un Security Council ◽  
Person Game

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