Network Heterogeneity and a Coordination Game

We investigate a two-strategy logit choice coordination game on heterogeneous networks. Degree is a number of links a vertex has and heterogeneous network is a network whose variance of degree distribution is large. We obtain mean-field approximate solution. We show that the heterogeneity of a network has an influence on the outcome. The magnitude of heterogeneity determines the number of stable steady states and the characteristics of the stable steady states. The network heterogeneity also determines which of the stable steady states is realized and the probability that a strategy is chosen in a given stable steady state.