Stable network topologies using the notion of covering
From MaRDI portal
(Redirected from Publication:439583)
Recommendations
- Identifying stable network structures and sets of key players using a \(W\)-covering perspective
- Stable and emergent network topologies: a structural approach
- A characterization of stochastically stable networks
- Measuring the robustness of a network using minimal vertex covers
- Network topology, higher orders of stability and efficiency
Cites work
- A Noncooperative Model of Network Formation
- A strategic model of social and economic networks
- Centers in Connected Undirected Graphs: An Axiomatic Approach
- Connections. An introduction to the economics of networks.
- Graphs and Cooperation in Games
- Networks, information and choice
- Paths in graphs
- Stable and emergent network topologies: a structural approach
- The structure and dynamics of networks
Cited in
(9)- Asymmetric flow networks
- scientific article; zbMATH DE number 5212783 (Why is no real title available?)
- scientific article; zbMATH DE number 6871091 (Why is no real title available?)
- Nash-stable coalition partition and potential functions in games with coalition structure
- Heuristic decision making in network linking
- Dynamic network formation with ordered partitioning and incomplete information
- Structural stability of coalitions: a formal model highlighting the role of participants positioned between members and neutral actors
- Identifying stable network structures and sets of key players using a \(W\)-covering perspective
- Communication network formation with link specificity and value transferability
This page was built for publication: Stable network topologies using the notion of covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439583)