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

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 investigate the role of manipulation in a model of opinion formation. Agents repeatedly communicate with their neighbors in the social network, can exert effort to manipulate the trust of others, and update their opinions about some common issue by taking weighted averages of neighbors'...

We investigate the role of manipulation in a model of opinion formation. Agents repeatedly communicate with their neighbors in the social network, can exert effort to manipulate the trust of others, and update their opinions about some common issue by taking weighted averages of neighbors'...

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