Abstract
A solution concept is introduced that is able to deal with cyclic relations. The concept is a generalization of the Von Neumann-Morgenstern solution concept of stable set and is therefore called the concept of generalized stable set. Its point of departure is the transitive closure of an asymmetric relation. A characterization theorem and an existence theorem are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Behzad M, Chartrand G, Lesniak-Foster L (1979) Graphs and digraphs. Prindle, Weber and Schmidt International Series
Duchet P (1987) A sufficient condition for a graph to be kernel-perfect. J Graph Theory 11: 81–85
Galeana-Sanchez H, Neuman-Lara V (1984) On kernels and semikernels of digraphs. Discr Math 48: 67–76
Harary F, Norman RZ, Cartwright D (1965) Structural models: an introduction to the theory of directed graphs. Wiley, New York
Lucas WF (1977) The existence problem for solutions. In: Henn R, Moeschn O (eds) Mathematical economics and game theory. Essays in honor of Oskar Morgenstern. Springer, Berlin Heidelberg New York
Richardson M (1953) Solutions of irreflexive relations. Ann Math 58: 573–590
Von Neumann J, Morgenstern O (1947) Theory of games and economic behavior, 2nd edn. Princeton University Press, Princeton
Author information
Authors and Affiliations
Additional information
The author would like to thank Thom Bezembinder, Maurice Salles and Harrie de Swart for their useful comments.
Rights and permissions
About this article
Cite this article
van Deemen, A.M.A. A note on generalized stable sets. Soc Choice Welfare 8, 255–260 (1991). https://doi.org/10.1007/BF00177663
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00177663