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...

We consider voting games as procedures to aggregate individual preferences. We survey positive results on the nonemptiness of the core of voting games and explore other solutions concepts that are basic supersets of the core such as Rubinstein's stability set and two types of uncovered sets. We...