On Cooperative Solutions of a Generalized Assignment Game: Limit Theorems to the Set of Competitive Equilibria

Abstract

We study two cooperative solutions of a market with indivisible goods modeled as a generalized assignment game: Set-wise stability and Core. We establish that the Set-wise stable set is contained in the Core and contains the non-empty set of competitive equilibrium payoffs. We then state and prove three limit results for replicated markets. First, the Set-wise stable set of a two-fold replicated market already coincides with the set of competitive equilibrium payoffs. Second, the sequence of Cores of replicated markets converges to the set of competitive equilibrium payoffs when the number of replicas tends to infinity. Third, for any number of replicas there is a market with a Core payoff that is not a competitive equilibrium payoff.