Convex semi-infinite games (Q1065725): Difference between revisions
From MaRDI portal
Latest revision as of 10:20, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Convex semi-infinite games |
scientific article |
Statements
Convex semi-infinite games (English)
0 references
1986
0 references
This paper introduces a generalization of semi-infinite games. The pure strategies for player I involve choosing one function from an infinite family of convex functions, while the set of mixed strategies for player II is a closed convex set C in \(R^ n\). The minimax theorem applies under a condition which limits the directions of recession of C. Player II always has optimal strategies. These are shown to exist for player I also if a certain infinite system verifies the property of Farkas- Minkowski. The paper also studies certain conditions that guarantee the finiteness of the value of the game and the existence of optimal pure strategies for player I.
0 references
inequality theory
0 references
Farkas-Minkowski systems
0 references
semi-infinite games
0 references
minimax theorem
0 references
finiteness of the value
0 references
existence of optimal pure strategies
0 references