Abstract
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.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Similar content being viewed by others
References
Berge C (1966) Espaces topologiques et fonctions multivoques. Dunod, Paris
Bordes G, Le Breton M, Salles M (1988) Gillies and Miller's subrelations of a relation over an infinite set of alternatives: general results and applications to voting games. Mimeograph
Cox GW (1984) Non-collegial simple games and the nowhere denseness of preference profiles havving a core. Social Choice and Welfare 1: 159–164
Ferejohn JA, Grether DM (1974) On a class of rational social decision procedures. Journal of Economic Theory 8: 471–482
Gillies DB (1959) Solutions to general non-zero-sum games, in: Tucker AW, Luce RD (eds) Contributions to the theory of games, volume IV. Princeton University Press, Princeton
Greenberg J (1979) Consistent majority rules over compact sets of alternatives. Econometrica 47: 627–636
Greenberg J, Weber S (1984) Balancedness, nonemptiness of the core and the existence of a majority equilibrium. International Journal of Game Theory 13: 65–68
Hildenbrand W (1974) Core and equilibria of a large economy. Princeton University Press, Princeton
Le Breton M (1987) On the core of voting games. Social Choice and Welfare 4: 295–305
Luce RD, Raiffa H (1958) Games and decisions. Wiley, New York
Miller N (1980) A new solution set for tournament and majority voting: further graph theoretical approaches to the theory of voting. American Journal of Political Science 24: 68–96
Moulin H (1983) The strategy of social choice. North-Holland, Amsterdam
Moulin H (1986) Choosing from a tournament. Social Choice and Welfare 3: 271–291
Nakamura K (1979) The vetoers in a simple game with ordinal preferences. International Journal of Game Theory 8: 55–61
Peleg B (1978 a) Consistent voting systems. Econometrica 46: 153–161
Peleg B (1978 b) Representation of simple games by social choice functions. International Journal of Game Theory 7: 81–94
Peleg B (1984) Game theoretic analysis of voting in committes. Cambridge University Pree, Cambridge
Rosenthal RW (1972) Cooperative games in effectiveness form. Journal of Economic Theory 5: 88–101
Roth AE (1976) Subsolutions and the supercore of cooperative games. Mathematics of Operations Research 1: 43–49
Rubinstein A (1979) A note on the nowhere denseness of societies having an equilibrium under majority rule. Econometrica 47: 511–514
Rubinstein A (1980) Stability of decision systems under majority rule. Journal of Economic Theory 23: 150–159
Schofield N (1984 a) Social equilibrium and cycles on compact sets. Journal of Economic Theory 33: 59–71
Schofield N (1984 b) Classification theorem for smooth social choice on a manifold. Social Choice and Welfare 1: 187–210
Schofield N (1985) Social choice and democracy. Springer, Berlin
Schofield N (1986) Permutation cycles and manipulation of choice functions. Social Choice and Welfare 3: 107–117
Sen AK (1986) Social choice theory, in: Arrow KJ, Intriligator MD (eds) Handbook of mathematical economics, volume III. North-Holland, Amsterdam
Vickrey W (1953) Strong and weak solutions in the theory of games. Mimeograph
Author information
Authors and Affiliations
Additional information
We are most grateful to the French Commissariat Général du Plan for financial support and to Georges Bordes, Prasanta K. Pattanaik, Hervé Moulin, Bezalel Peleg, Ariel Rubinstein, Norman Schofield and two anonymous referees of this journal for helpful comments. In particular, Bezalel Peleg has called our attention to the similarities of the stability set with the Gillies set and the uncovered set. A previous draft of this paper has been presented at the conference on “Economic Models and Distributive Justice” in Brussels, at the European Meeting of the Econometric Society in Copenhagen and at seminars in Europe and the United States. We thank the participants for their remarks.
Rights and permissions
About this article
Cite this article
Le Breton, M., Salles, M. The stability set of voting games: Classification and genericity results. Int J Game Theory 19, 111–127 (1990). https://doi.org/10.1007/BF01761071
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01761071