On the Chacteristic Numbers of Voting Games

Abstract

This paper deals with the non-emptiness of the stability set for any proper voting game. We present an upper bound on the number of alternatives which guarantees the non emptiness of this solution concept. We show that this bound is greater than or equal to the one given by Le Breton and Salles (1990) for quota games.voting game, core, stability set