A characterization of absorbing sets in coalition formation games
Agustin G. Bonifacio, Elena Inarra, Pablo Neme
TL;DR
The paper addresses absorbing sets in coalition formation via a novel reduced form that aggregates the essential structure of absorbing sets into generalized rings, fixed components, and singletons. It proves a bijection between absorbing sets and reduced forms, enabling analysis of convergence to stability without enumerating all coalition structures. The approach yields necessary and sufficient conditions for convergence under various economic environments, including bargaining and rationing rules, and clarifies how properties like pairwise alignment and common ranking influence stability. The results unify and extend known outcomes in roommate problems and provide a framework for future work on dynamic rules and indifferences.
Abstract
Given a standard myopic dynamic process among coalition structures, an absorbing set is a minimal collection of such structures that is never left once entered through that process. Absorbing sets are an important solution concept in coalition formation games, but they have drawbacks: they can be large and hard to obtain. In this paper, we characterize an absorbing set in terms of a collection consisting of a small number of sets of coalitions that we refer to as a "reduced form" of a game. We apply our characterization to study convergence to stability in several economic environments.
