The Subgame-Consistent Shapley Value for Dynamic Network Games with Shock

2015 ◽  
Vol 6 (4) ◽  
pp. 520-537 ◽  
Author(s):  
Leon Petrosyan ◽  
Artem Sedakov
Keyword(s):  
Shapley Value ◽  
Dynamic Network ◽  
Network Games

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.

scholarly journals Dynamic cooperative network games with pairwise interactions

2020 ◽  
Vol 13 ◽  
pp. 95-120
Author(s):  
Mariia A. Bulgakova ◽  
Keyword(s):  
Dynamic Network ◽  
Pairwise Interaction ◽  
Cooperative Network ◽  
Two Stage ◽  
Network Games ◽  
Pairwise Interactions

This article is an overview of results obtained in the field of dynamic network games with pairwise interaction. The paper provides a summary and analysis of works related to two-stage and multistage nonzero-sum games based on pairwise interaction. The meaning of pairwise interaction is to consider the game as a family of games occurring on a network between pairs of players (vertices of a graph) connected to each other by an edge. The network can be set or formed in the first stage. In the paper, solutions of cooperative pairwise interaction games are also considered.

scholarly journals Shapley value for differential network games: Theory and application

2019 ◽  
Vol 0 (0) ◽  
pp. 0-0
Author(s):  
Leon Petrosyan ◽  
◽  
David Yeung ◽  
Keyword(s):  
Shapley Value ◽  
Network Games ◽  
Differential Network ◽  
Games Theory

A Comparative study on secure routing algorithms SAODV and A-SAODV in Mobile AdHoc Networks (MANET) – The Enhancements of AODV

2012 ◽  
Vol 3 (2) ◽  
pp. 419-423
Author(s):  
JARUPULA RAJESHWAR ◽  
Dr G NARSIMHA
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Dynamic Network ◽  
Secure Routing ◽  
Mobile Adhoc Networks ◽  
Security Challenges ◽  
Basic Protocol ◽  
Freely Moving ◽  
Adhoc Networks ◽  
Secure Routing Protocols

A freely moving nodes forming as group to communicate among themselves are called as Mobile AdHoc Networks (MANET). Many applications are choosing this MANET for effective commutation due to its flexible nature in forming a network. But due to its openness characteristics it is posing many security challenges. As it has highly dynamic network topology security for routing is playing a major role. We have very good routing protocols for route discovery as well as for transporting data packers but most of them lack the feature of security like AODV. In this paper we are studying the basic protocol AODV and identify how it can be made secure. We are studying a protocol S-AODV which is a security extension of AODV which is called Secure AODV (S-AODV) and we are studying enhanced version of S-AODV routing protocol a Adaptive Secure AODV (A-SAODV). Finally we have described about the parameter to be taken for performance evaluation of different secure routing protocols

Sign in / Sign up

Export Citation Format

Share Document