On Noncooperative Games and Minimax Theory
June 2005
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ERS 2005 036 LIS.pdf, 0.3MB) |
In this note we review some known minimax theorems with applications in game theory and show that these results form an equivalent chain which includes the strong separation result in finite dimensional spaces between two disjoint closed convex sets of which one is compact. By simplifying the proofs we intend to make the results more accessible to researchers not familiar with minimax or noncooperative game theory.
Keywords
Classifications using
Journal of Economic Literature (JEL) Classification System
- C72 : Noncooperative Games
- M : Business Administration and Business Economics; Marketing; Accounting
- R4 : Transportation Systems
- M11 : Production Management
Automatically Extracted Terms
- result
- minimax
- theorem
- player
- minimax result
- x y r
- maxxx
- function
- inf f
- ky fan
- action
- von neumann
- theory
- player 1
- relation
- proof
- maxxx fe
- function f
- research
- player 2
