STABLE SETS FOR SIMPLE GAMES WITH ORDINAL PREFERENCES

Abstract

In this paper, stable sets for simple games with ordinal preferences are studied in the case where the number of alternatives is finite. It is shown that the condition for the existence of a nonempty core for any possible combination of players' preferences is also a necessary and sufficient condition for the existence of a unique stable set. Moreover, a necessary and sufficient condition that proper simple games have at least one stable set is presented.