A set of coalition structures <em>P</em> is farsightedly stable (i) if all possible deviations from any coalition structure p belonging to <em>P</em> to a coalition structure outside <em>P</em> are deterred by the threat of ending worse off or equally well off, (ii) if there exists a farsighted improvingpath from any...

We revisit n-player coordination games with Pareto-ranked Nash equilibria. The novelty is that we introduce fuzzy play and a matching device, where each player does not choose which pure strategy to play, but instead chooses a nonempty subset of his strategy set that he submits to the matching...

We study stable sets for marriage problems under the assumption that players can be both myopic and farsighted. We introduce the new notion of the myopic-farsighted stable set. For the special cases where all players are myopic and where all players are farsighted, our concept predicts the set...

A set of networks G is pairwise farsightedly stable (i) if all possible farsighted pairwise deviations from any network g[set membership, variant] 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...

Social environments constitute a framework in which it is possible to study how groups of agents interact in a society. The framework is general enough to analyse both non-cooperative and cooperative games. We identify a number of shortcomings of existing solution concepts that are used for...

Social environments constitute a framework in which it is possible to study how groups of agents interact in a society. The framework is general enough to analyse both non-cooperative and cooperative games. We identify a number of shortcomings of existing solution concepts that are used for...

We propose a new concept, the pairwise farsightedly stable set, in order to predict which networks may be formed among farsighted players. A set of networks G is pairwise farsightedly stable (i) if all possible pairwise deviations from any network g ∈ G to a network outside G are deterred by...

We revisit n-player coordination games with Pareto-ranked Nash equilibria. As a novelty, we introduce fuzzy play and a matching device. By fuzzy play we mean that each player does not choose which pure strategy to play, but instead chooses a nonempty subset of his strategy set that he submits to...