Farsightedly stable networks

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

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic


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.

Datasource: no data
Original languageEnglish
Title of host publicationCoalitions and Networks, 12 Papers from 20 Years of CTN Workshops
EditorsC. Carraro
Place of PublicationMilano
PublisherFEEM Press
ISBN (Print)9788890991899
Publication statusPublished - 1 Jan 2015


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

Cite this