Quasikonkav-quasikonvexe spiele unter ausnutzung gegneriseker schwäcken und lexikographisehe optimierung1
Author:
- 1 January 1977
- journal article
- research article
- Published by Taylor & Francis in Mathematische Operationsforschung und Statistik. Series Optimization
- Vol. 8 (1) , 75-88
Abstract
There exists at least one pure strategy for each player of zero-sum two-person matrix-game which, if used against anyone of his opponent's optimal mixed strategic, yields the value of the game. This assertion will be extend to games where the payoff function is quasi concave quasi convex and upper/lower semi continuous. The result will be applied to games where one of the two players takes maximum advantage of the mistakes, if any, of his opponent. It will be shown that this problem is equivalence to a problem of Lexicographic multi objective Programming.Keywords
This publication has 8 references indexed in Scilit:
- Convex Analysis1970
- Convexity and Optimization in Finite Dimensions I1970
- Strictly quasi-convex (concave) functions and duality in mathematical programmingJournal of Mathematical Analysis and Applications, 1967
- Seven Kinds of ConvexitySIAM Review, 1967
- The Direct Power of Adjacent Vertex Programming MethodsManagement Science, 1965
- Bounds for functionally convex optimal control problemsJournal of Mathematical Analysis and Applications, 1964
- Quasi-Concave ProgrammingEconometrica, 1961
- On general minimax theoremsPacific Journal of Mathematics, 1958