On the determinateness of semi-infinite bimatrix games.
| Autor: | Jurg, Peter, Tijs, Stef |
|---|---|
| Zdroj: | International Journal of Game Theory; Dec1992, Vol. 21 Issue 4, p361-369, 9p |
| Abstrakt: | In this paper it is shown that every 2 × ∞ bimatrix game is weakly determined. For the proof of this fact we introduce ɛ-optimal and k-guaranteeing points for a convex set in IR and a labeling technique which is typical for 2 × ∞ bimatrix games. [ABSTRACT FROM AUTHOR] |
| Databáze: | Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink