We study the dynamics of individual beliefs and information aggregation when agents communicate via a social network. We provide a general framework of social learning that captures the interactive effects of three main factors on the structure of individual beliefs resulting from such a dynamic...

This paper introduces a general framework for dealing with dynamic inconsistency in the context of Markov decision problems. It carefully decouples and examines concepts that are often entwined in the literature it distinguishes between the decision maker and its various temporal agents, and...

We show that feasible elimination procedures Peleg, 1978 can be used to select k from m alternatives. An important advantage of this method is the core property no coalition can guarantee an outcome that is preferred by all its members. We also provide an axiomatic characterization for the case...

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 consider effectivity functions for finitely many players and alternatives. We assume that players have incomplete information with respect to the preferences of the other players. Our main result is the characterization of effectivity functions which have an ex post Nash consistent...