Rationalizability is a central concept in game theory. Since there may be many rationalizable strategies, applications commonly use refinements to obtain sharp predictions. In an important paper, Weinstein and Yildiz (2007) show that none of these refinements is robust to perturbations of...

This paper explores the manner in which the structure of a social network constrains the level of inequality that can be sustained among its members. We assume that any distribution of value across the network must be stable with respect to coalitional deviations, and that players can form a...

The minority game is a simple congestion game in which the players? main goal is to choose among two options the one that is adopted by the smallest number of players. We characterize the set of Nash equilibria and the limiting behavior of several well-known learning processes in the minority...

This paper gives a critical account of the minority game literature. The minority game is a simple congestion game: players need to choose between two options, and those who have selected the option chosen by the minority win. The learning model proposed in this literature seems to differ...

A random intersection graph is constructed by independently assigning each vertex a subset of a given set and drawing an edge between two vertices if and only if their respective subsets intersect. In this paper a model is developed in which each vertex is given a random weight, and vertices...