Stability and largeness of core for symmetric games

Largeness of the core is sufficient for stability of the core. In general the necessity is not known. In this paper we answer affirmatively the necessity for symmetric games. We also prove its equivalence to n specified vectors being imputations and also to the convexity of the lower boundary of the set of all acceptable pay-off vectors of the game. In this paper we establish the equivalence of a condition given by Shapley to the newly evolved condition, thereby give an alternate proof to Shapley's condition

Stability and largeness of core for symmetric games

Largeness of the core is sufficient for stability of the core. In general the necessity is not known. In this paper we answer affirmatively the necessity for symmetric games. We also prove its equivalence to n specified vectors being imputations and also to the convexity of the lower boundary of the set of all acceptable pay-off vectors of the game. In this paper we establish the equivalence of a condition given by Shapley to the newly evolved condition, thereby give an alternate proof to Shapley's condition.Symmetric game, stable core, lower boundary, specified vectors