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 the criminal networks that will emerge in the long run when criminals are neither myopic nor completely farsighted but have some limited degree of farsightedness. We adopt the horizon-K farsighted set to answer this question. We find that in criminal networks with n criminals, the set...

We consider Rubinstein's two-person alternating-offer bargaining model with two-sided incomplete information. We investigate the effects of one party having relative concerns about the bargaining outcome and the delay in reaching an agreement. We find that facing an opponent with stronger...

We study the stability of social and economic networks when players are farsighted. We first provide an algorithm that characterizes the unique pairwise and groupwise farsightedly stable set of networks under the componentwise egalitarian allocation rule. We then show that this set coincides...

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