We present experiments on repeated non-cooperative network formation games, based on Bala and Goyal (2000). We treat … coordination problems. We conduct experiments under various conditions which control for salient labeling and learning dynamics …. Contrary to previous experiments, we find that coordination on non-empty Strict Nash equilibria is not an easy task for …

We present experiments on repeated non-cooperative network formation games, based on Bala and Goyal (2000). We treat … coordination problems. We conduct experiments under various conditions which control for salient labeling and learning dynamics …. Contrary to previous experiments, we find that coordination on non-empty Strict Nash equilibria is not an easy task for …

equilibria consumers search less frequently in denser networks. Finally, when search costs are low the expected price and the …

equilibria consumers search less frequently in denser networks. Finally, when search costs are low the expected price and the …

We report the findings of experiments designed to study how people learn in network games. Network games offer new … opportunities to identify learning rules, since on networks (compared to, e.g., random matching) more rules differ in terms of their …

real-life social networks. …

predominance of star-like structures in real-life social networks. …

deliver an understanding of why specific equilibrium networks are selected or whether they are all actually reachable from any …

are not in line: While theory typically predicts inefficient outcomes for (anti-)coordination games, experiments show that …