Mixed strategies for hierarchical zero-sum games (Q4530565)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1748674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mixed strategies for hierarchical zero-sum games |
scientific article; zbMATH DE number 1748674 |
Statements
24 March 2003
0 references
convexity
0 references
zero-sum
0 references
mixed stratigies
0 references
0.7858307361602783
0 references
0.7741692662239075
0 references
0.7649506330490112
0 references
Mixed strategies for hierarchical zero-sum games (English)
0 references
The authors consider hierarchical games with two followers, playing a zero-sum and without convexity assumptions on their cost functions. It is an extension of the authors' previous paper and the results are obtained in two different situations. A number of theorems and definitions are proposed for validation. For the entire collection see [Zbl 0982.00053].
0 references