On Balanced Games with Infinitely Many Players: Revisiting Schmeidler's Result
Abstract: We consider transferable utility cooperative games with infinitely many players and the core understood in the space of bounded additive set functions. We show that, if a game is bounded below, then its core is non-empty if and only if the game is balanced. This finding is a generalization of Schmeidler's (1967) original result ``On Balanced Games with Infinitely Many Players'', where the game is assumed to be non-negative. We furthermore demonstrate that, if a game is not bounded below, then its core might be empty even though the game is balanced; that is, our result is tight. We also generalize Schmeidler's (1967) result to the case of restricted cooperation too.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.