An extension of Sion's minimax theorem with an application to a method for constrained games (Q790412)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An extension of Sion's minimax theorem with an application to a method for constrained games |
scientific article; zbMATH DE number 3848093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extension of Sion's minimax theorem with an application to a method for constrained games |
scientific article; zbMATH DE number 3848093 |
Statements
An extension of Sion's minimax theorem with an application to a method for constrained games (English)
0 references
1982
0 references
The author presents a minimax theorem for quasi-concave-convex functions defined on noncompact sets and satisfying so called sup inf-compact conditions. This is a base for obtaining a solution of two-person zero- sum games over constrained sets. An approximate approach is substantiated with the aid of the interior penalty method in nonlinear programming.
0 references
minimax theorem for quasi-concave-convex functions
0 references
sup inf-compact conditions
0 references
two-person zero-sum games
0 references
0.8328551650047302
0 references
0.8313574194908142
0 references
0.8007512092590332
0 references
0.7971534729003906
0 references
