Farsightedly stable networks

P.J.J. Herings*, A. Mauleon, V. Vannetelbosch

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

119 Downloads (Pure)


A set of networks g is pairwise farsightedly stable (i) if all possible farsighted pairwise deviations from any network g? g to a network outside g are deterred by the threat of ending worse off or equally well off, (ii) if there exists a farsighted improving path from any network outside the set leading to some network in the set, and (iii) if there is no proper subset of g satisfying conditions (i) and (ii). A non-empty pairwise farsightedly stable set always exists. We provide a full characterization of unique pairwise farsightedly stable sets of networks. Contrary to other pairwise concepts, pairwise farsighted stability yields a pareto dominant network, if it exists, as the unique outcome. Finally, we study the relationship between pairwise farsighted stability and other concepts such as the largest pairwise consistent set and the von neumann–morgenstern pairwise farsightedly stable set.
Original languageEnglish
Pages (from-to)526-541
Number of pages16
JournalGames and Economic Behavior
Publication statusPublished - 1 Jan 2009


Dive into the research topics of 'Farsightedly stable networks'. Together they form a unique fingerprint.

Cite this