STABILITY OF VOTING GAMES

This paper generalizes the result of Le Breton and Salles (1990) about stable set (far-sighted core of order 1) for voting games to far-sighted core of arbitrary order. Let m be the number of alternatives, n be the number of voters and G (n, k) be a proper symmetric simple game in which the size of a winning coalition is greater or equal to k. It is shown that the far-sighted core of order d for G (n, k) is nonempty for all preference profiles and for all n and k with [n/(n - k)] = v1 iff m less-than-or-equal-to (d + 1) (v - 1).