Discrete control and algorithms for solving antagonistic dynamic games on networks (Q3391895): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal paths in network games with \(p\) players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic \(c\)-games on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Latest revision as of 20:47, 1 July 2024

scientific article
Language Label Description Also known as
English
Discrete control and algorithms for solving antagonistic dynamic games on networks
scientific article

    Statements

    Discrete control and algorithms for solving antagonistic dynamic games on networks (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2009
    0 references
    max-min control problem
    0 references
    antagonistic dynamic game
    0 references
    max-min path
    0 references
    positional games
    0 references
    \(c\)-game on financial networks
    0 references

    Identifiers