Search

This paper examines a dynamic process of n-person coalitional bargaining problems. We study the stochastic evolution of social conventions by embedding a static bargaining setting in a dynamic process; Over time agents revise their coalitions and surplus distributions in the presence of stochastic payoff shocks which lead agents to make a suboptimal choice. Under a logit specification of choice probabilities, we find that the stability of a core allocation decreases in the wealth of the richest player, and that stochastically stable allocations are core allocations which minimize the wealth of the richest.

This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.