We study farsighted coalitional stability in the context of TU-games. We show that every TU-game has a nonempty largest consistent set and that each TU-game has a von Neumann-Morgenstern farsighted stable set. We characterize the collection of von Neumann-Morgenstern farsighted stable sets. We...

We study farsighted coalitional stability in the context of TUgames. Chwe (1994, p.318) notes that, in this context, it is difficult to prove nonemptiness of the largest consistent set. We show that every TU-game has a nonempty largest consistent set. Moreover, the proof of this result points...

In this paper, we consider situations where agents face repeatedly the same decision problem. We focus on adaptive rules without beliefs. We distinguish between two kinds of models. Firstly, we study adaptive rules that are only based on private information. Decisions are made on the basis of...

A new model of strategic networking is developed and analyzed, where an agent's investment in links is nonspecific. The model comprises a large class of games which are both potential and super- or submodular games. We obtain comparative statics results for Nash equilibria with respect to...

We study strategic games where players' preferences are weak orders which need not admit utility representations. First of all, we ex- tend Voorneveld's concept of best-response potential from cardinal to ordi- nal games and derive the analogue of his characterization result: An ordi- nal game...