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

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

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 adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von...

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

Pairwise stability (Jackson and Wolinsky, 1996) is the standard stability concept in network formation. It assumes myopic behavior of the agents in the sense that they do not forecast how others might react to their actions. Assuming that agents are farsighted, related stability concepts have...