Abstract
One of the most important stability concepts for network formation is pairwise stability. We develop a homotopy algorithm that is effective in computing pairwise stable networks for a generic network formation problem. To do so, we reformulate the concept of pairwise stability as a Nash equilibrium of a non-cooperative game played by the links in the network and adapt the linear tracing procedure for non-cooperative games to the network formation problem. As a by-product of our main result, we obtain that the number of pairwise stable networks is generically odd. We apply the algorithm to the connections model and obtain a number of novel insights.
Original language | English |
---|---|
Journal | Mathematical Programming |
DOIs | |
Publication status | E-pub ahead of print - 14 Mar 2022 |
Keywords
- Computation of equilibria
- Connections model
- Pairwise stable network
- Tracing procedure