We adopt the largest consistent set defined by Chwe [J. of Econ. Theory 63 (1994), 299-235] to predict which coalition structures are possibly stable when players are farsighted. We also introduce a refinement, the largest cautious consistent set, based on the assumption that players are...

We adopt the notion of von Neumann-Morgenstern (vNM) farsightedly stable sets to determine which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of vNM farsightedly stable sets: a set of matchings is a vNM farsightedly...

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...

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...

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, which is based on the notion of a myopic-farsighted improving path. A myopic-farsighted stable set is the set of...

We study von Neumann Morgenstern stable sets for one-to-one matching problems under the assumption of coalitional sovereignty, meaning that a deviating coalition of players does not have the power to arrange the matches of agents outside the coalition. We study both the case of pairwise and...

We consider marriage problems where myopic and farsighted players interact. To study such problems, we use the pairwise myopic-farsighted stable set. Blocking occurs by coalitions of size one or two. We require that all blocking players should strictly improve. We pay particular attention to the...

We adopt the notion of von Neumann-Morgenstern (vNM) farsightedly stable sets to determine which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of vNM farsightedly stable sets: a set of matchings is a vNM farsightedly...

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...

We adopt the largest consistent set defined by Chwe [J. of Econ. Theory 63 (1994), 299-235] to predict which coalition structures are possibly stable when players are farsighted. We also introduce a refinement, the largest cautious consistent set, based on the assumption that players are...