NETWORK STRUCTURE IN A LINK FORMATION GAME: AN EXPERIMENTAL STUDY

Abstract

In this article, we use an experiment to evaluate the performance of alternative refinements in a Myersonian link formation game with a supermodular payoff function. Our results show that a non‐cooperative refinement, the global games (GG) approach, outperforms alternative cooperative refinements (strong Nash equilibrium, coalition‐proof Nash equilibrium, and pairwise stable Nash equilibrium) in explaining the observed experimental behavior in the static game of complete information with three players. The results are robust to some comparative statics and the GG approach shows a high predictive power under incomplete information. However, under repeated interaction or with a greater number of players, the GG approach loses predictive power, but so do the cooperative refinements. The results illustrate the importance of coordination failure in practice and the need to design mechanisms to reduce this effect in practical decision‐making problems. (JEL C70, C92, D20, D44, D82)