Date of This Version
September 2008
Abstract
We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical monotonicity. The n-player group version always yields efficiency.
Recommended Citation
Nieva, Ricardo, "Networks with Group Counterproposals" (September 15, 2008). Fondazione Eni Enrico Mattei Working Papers. Paper 220.
https://services.bepress.com/feem/paper220
COinS