Search

In 1980 Rubinstein introduced a new solution concept for voting games called the stability set which incorporates the idea that before entering into a possibly winning coalition with respect to some pair of alternatives, a voter will consider what might happen in the future. He showed that if the voters' preferences are given by linear orders the stability set is non-empty for a large class of voting games with finite sets of alternatives. We consider the case where indifference is allowed (preferences are then complete preorders) and show that the picture is then quite different. First, in the finite case, we obtain classification results for the non-emptiness of the stability set which are based on Nakamura's number. When preferences are continuous, we prove a general non-emptiness theorem and show that the set of profiles for which the stability set is non-empty is dense in the set of profiles. [ABSTRACT FROM AUTHOR]