The Analysis of Leadership Formation in Networks Based on Shapley Value

Abstract

Abstract

Shapley-Based Stackelberg Leadership Formation in Networks

“…ii The section uses partly or exclusively text and data from Belik, I., & Jornsten, K. (2015) The advantage of the given algorithm is the polynomial running time O(V+E) (Cormen, Leiserson, Rivest, & Stein, 2003) to compute SVs for all nodes in G(V,E) based on equation (2). To illustrate how the algorithm works we consider the trivial example (see Figure 1).…”

The Method of Leader's Overthrow in Networks

“…The analysis of the leadership position in a network is an important problem. Corresponding approaches have been presented in Balkundi & Kilduff (2006), Hoppe & Reinelt (2010), Belik & Jornsten (January, 2015) and in Belik & Jornsten (April, 2015).…”