Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-09T19:44:25.476Z Has data issue: false hasContentIssue false

An existence theorem for abstract stable sets

Published online by Cambridge University Press:  09 April 2009

Chih Chang
Affiliation:
Tsing Hua Institute of Applied Mathematics National Tsing Hua UniversityHsinchu, TaiwanR.O.C.
Gerard J. Chang
Affiliation:
Institute of Applied Mathematics National Chiao Tung UniversityHsinchu, TaiwanR. O. C.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We provide an existence theorem for stable sets which is equivalent to Zorn's lemma and study the connections between the unique stable set for majorization and the stable sets for the dominance relation.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1991

References

[1]Chang, C., ‘Absorbing set for n-Person Games’, Z. Oper. Res. Ser. A 31 (1987), 1529.Google Scholar
[2]Gillies, D. B., Solutions to general non-zero sum games, Ann. of Math. Studies 40, Princeton University Press, Princeton, N. J., 1959, 4780.Google Scholar
[3]Lucas, W. F., ‘A game with no solution’, Bull. Amer. Math. Soc. (N.S.) 74 (1968), 237239.CrossRefGoogle Scholar
[4]Lucas, W. F., ‘The proof that a game may not have solution’, Trans. Amer. Math. Soc. 137 (1969), 219229.CrossRefGoogle Scholar
[5]Lucas, W. F., ‘Some recent developments in n-person game theorySIAM Rev. 13 (1971), 491523.CrossRefGoogle Scholar
[6]Suppes, P., Axiomatic set theory, (Dover, 1960).Google Scholar
[7]von Neumann, J. and Morgenstern, O., Games and economic behavior, (3rd. edition, Princeton Press, 1953).Google Scholar