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 (Q877607): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5588281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal paths in network games with \(p\) players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5626720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4112524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5665021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time dependency in multiple objective dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5325635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for \(k\)-partite networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5821521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431281 / rank
 
Normal rank

Latest revision as of 18:23, 25 June 2024

scientific article
Language Label Description Also known as
English
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
scientific article

    Statements

    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 (English)
    0 references
    0 references
    0 references
    3 May 2007
    0 references
    0 references
    time-discrete system
    0 references
    multi-objective control
    0 references
    \(c\)-game on networks
    0 references
    Nash equilibria
    0 references
    Pareto optima
    0 references
    multiobjective games
    0 references
    Pareto-Nash equilibria
    0 references
    0 references