A note on connectivity and stability in dynamic network formation
From MaRDI portal
Publication:2223660
Summary: We consider the dynamic network formation problem under the requirement that the whole network be connected and remain connected after \(q\) nodes are destroyed. We propose the concept of dynamic \(\mathcal{C}^q\)-stability and characterize dynamic \(\mathcal{C}^q\)-stable networks for any \(q \geq 0\). Comparison with the outcome in the static model is also discussed.
Recommendations
Cites work
- A dynamic model of network formation
- A strategic model of social and economic networks
- Attack, Defence, and Contagion in Networks
- Connectivity, stability and efficiency in a network as an information flow
- Farsighted coalitional stability
- Network design and defence
- Networks and farsighted stability
- On a network creation game
- The curse of simultaneity
- The evolution of social and economic networks.
Cited in
(8)- Network connectivity under node failure
- Network formation and pairwise stability: a new oddness theorem
- A game theoretic approach to the analysis of dynamic networks
- Connectivity games over dynamic networks
- Connectivity games over dynamic networks
- Threshold-based network structural dynamics
- Overcoming the coordination problem: dynamic formation of networks
- Connectivity, stability and efficiency in a network as an information flow
This page was built for publication: A note on connectivity and stability in dynamic network formation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223660)
