DP12834 | Waiting for my neighbors

Publication Date

03/31/2018

JEL Code(s)

Keyword(s)

Programme Area(s)

Network(s)

Abstract

We introduce a neighborhood structure in waiting games where the players decide when to``stop" (exit a market, adopt a technology). The payoff of stopping increases each time a neighbor stops. We show that the dynamic evolution of the network starkly depends on initial parameters and can take the form of either a shrinking network, where players at the edges stop first, or a fragmenting network where interior players stop first making the network split up in smaller ones over time. We find that, in addition to the coordination inefficiency standard in waiting games, the neighbourhood structure gives rise to two other inefficiencies, the first linked to the order of exit and the second to the final distribution of remaining nodes. We consider subsidy programs aimed at correcting these inefficiencies.