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 study the stability of social and economic networks when players are farsighted. In particular, we examine whether the networks formed by farsighted players are different from those formed by myopic players. We adopt Herings, Mauleon and Vannetelbosch's (Games and Economic Behavior,...

We propose a new concept, the pairwise farsightedly stable set, in order to predict which networks may be formed among farsighted players. A set of networks G is pairwise farsightedly stable (i) if all possible pairwise deviations from any network g - G to a network outside G are deterred by the...

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

Jackson and Watts [J. of Econ. Theory 71 (2002), 44-74] have examined the dynamic formation and stochastic evolution of networks. We provide a refinement of pairwise stability, p-pairwise stability, which allows us to characterize the stochastically stable networks without requiring the "tree...

Jackson and Watts [J. of Econ. Theory 71 (2002), 44-74] have examined the dynamic formation and stochastic evolution of networks. We provide a refinement of pairwise stability, p-pairwise stability, which allows us to characterize the stochastically stable networks without requiring the tree...

We provide a tractable concept that can be used to study the influence of the degree of farsightedness on network stability. A set of networks GK is a level-K farsightedly stable set if three conditions are satisfied. First, external deviations should be deterred. Second, from any network...

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

This paper deals with N-person sequential bargaining games with complete information. For N-person sequential bargaining games, uniqueness of the SPE has been obtained by allowing the players to exit with partial agreements. Adopting a non-equilibrium approach, we show that N-person sequential...