z-logo
Premium
The Farsighted Stable Set
Author(s) -
Ray Debraj,
Vohra Rajiv
Publication year - 2015
Publication title -
econometrica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 16.7
H-Index - 199
eISSN - 1468-0262
pISSN - 0012-9682
DOI - 10.3982/ecta12022
Subject(s) - mathematical economics , independent set , stochastic game , von neumann architecture , presumption , mathematics , equivalence (formal languages) , set (abstract data type) , computer science , combinatorics , discrete mathematics , pure mathematics , graph , political science , law , programming language
Harsanyi (1974) criticized the von Neumann–Morgenstern (vNM) stable set for its presumption that coalitions are myopic about their prospects. He proposed a new dominance relation incorporating farsightedness, but retained another feature of the stable set: that a coalition S can impose any imputation as long as its restriction to S is feasible for it. This implicitly gives an objecting coalition complete power to arrange the payoffs of players elsewhere, which is clearly unsatisfactory. While this assumption is largely innocuous for myopic dominance, it is of crucial significance for its farsighted counterpart. Our modification of the Harsanyi set respects “coalitional sovereignty.” The resulting farsighted stable set is very different from both the Harsanyi and the vNM sets. We provide a necessary and sufficient condition for the existence of a farsighted stable set containing just a single‐payoff allocation. This condition roughly establishes an equivalence between core allocations and the union of allocations over all single‐payoff farsighted stable sets. We then conduct a comprehensive analysis of the existence and structure of farsighted stable sets in simple games. This last exercise throws light on both single‐payoff and multi‐payoff stable sets, and suggests that they do not coexist.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here