×

zbMATH — the first resource for mathematics

Control space properties of cooperative games. (English) Zbl 0185.24002

Keywords:
control theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Von Neumann, J., andMorgenstern, O.,Theory of Games and Economic Behavior, Princeton University Press, Princeton, New Jersey, 1947. · Zbl 1241.91002
[2] Nash, J.,Non-Cooperative Games, Annals of Mathematics, Vol. 54, No. 2, 1951. · Zbl 0045.08202
[3] Starr, A. W., andHo, Y. C.,Nonzero-Sum Differential Games, Journal of Optimization Theory and Applications, Vol. 3, No. 3, 1969. · Zbl 0169.12301
[4] Luce, R. D., andRaiffa, H.,Games and Decisions, John Wiley and Sons, New York, 1957. · Zbl 0084.15704
[5] Zadeh, L. A.,Optimality and Non-Scalar-Valued Performance Criteria, IEEE Transactions on Automatic Control, Vol. AC-8, No. 1, 1963.
[6] Basile, G., andVincent, T. L.,On the Cooperative Differential Game, Third Hawaii International Conference on System Sciences, Honolulu, Hawaii, 1970. · Zbl 0185.24003
[7] Isaacs, R.,Differential Games, John Wiley and Sons, New York, 1965.
[8] Cliff, E. M.,Mixed Strategies in Differential Games, University of Arizona, Ph.D. Thesis, 1969.
[9] Blaquière, A., Gérard, F., andLeitmann, G.,Quantitative and Qualitative Games, Academic Press, New York, 1969.
[10] Berkovitz, L. D.,A Survey of Differential Games, Mathematical Theory of Control, Edited by A. V. Balakrishnan, L. W. Neustadt, and L. A. Zadeh, Academic Press, New York, 1969. · Zbl 0182.43903
[11] Gantmacher, F. R.,The Theory of Matrices, Vol. 1, Chelsea Publishing Company, New York, 1960. · Zbl 0088.25103
[12] Da Cunha, N. O., andPolak, E.,Constrained Minimization under Vector-Valued Criteria, University of California at Berkeley, Memorandum No. ERL-M191, 1969.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.