A 2-person game on a polyhedral set of connected strategies (Q1356874): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: A. S. Belen'kij / rank
Normal rank
 
Property / author
 
Property / author: A. S. Belen'kij / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear max—min problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax planning problems with linear constraints and methods of their solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4126046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-person game on polyhedral sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max problems with monotone functions on polyhedral sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:51, 27 May 2024

scientific article
Language Label Description Also known as
English
A 2-person game on a polyhedral set of connected strategies
scientific article

    Statements

    A 2-person game on a polyhedral set of connected strategies (English)
    0 references
    5 October 1997
    0 references
    saddle points
    0 references
    2-person zero-sum game
    0 references
    sum of two linear functions
    0 references
    unbounded polyhedral set
    0 references
    min-max and max-min points
    0 references
    quadratic constraints
    0 references
    0 references

    Identifiers