On equivalent results in minimax theory

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

Access Rights

info:eu-repo/semantics/closedAccess

Abstract

In this paper we review known minimax theorems with applications in game theory and show that these theorems can be proved using the first minimax theorem for a two-person zero-sum game with finite strategy sets published by von Neumann in 1928. Among these results are the well known minimax theorems of Wald, Ville and Kneser and their generalizations due to Kakutani, Ky Fan, Konig, Neumann and Gwinner-Oettli. Actually, it is shown that these results form an equivalent chain and this chain includes the strong separation result in finite dimensional spaces between two disjoint closed convex sets of which one is compact. To show the implications the authors only use simple properties of compact sets and the well-known Weierstrass-Lebesgue lemma. (C) 2003 Elsevier B.V. All rights reserved.

Description

International Workshop on Smooth and Nonsmooth Optimization -- JUL 12-13, 2001 -- Rotterdam, NETHERLANDS

Keywords

game theory, convex programming

Journal or Series

European Journal of Operational Research

WoS Q Value

Scopus Q Value

Volume

157

Issue

1

Citation

Endorsement

Review

Supplemented By

Referenced By