Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks

DOI10.1016/j.dam.2007.03.012zbMath1119.49031OpenAlexW2068208813MaRDI QIDQ2383543

Stefan Pickl, Dmitrii D. Lozovanu

Publication date: 19 September 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.03.012

zbMATH Keywords

networkpolynomial-time algorithm\(c\)-gamesmultiobjective discrete control

Mathematics Subject Classification ID

Noncooperative games (91A10) Cooperative games (91A12) Applications of optimal control and differential games (49N90) Games involving graphs (91A43) Deterministic network models in operations research (90B10)

Related Items (3)

Necessary and sufficient conditions for protocell growth ⋮ Complex and detailed balancing of chemical reaction networks revisited ⋮ Project portfolio selection based on multi-project synergy

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
• Optimal paths in network games with \(p\) players
• Time dependency in multiple objective dynamic programming
• Non-cooperative games
• ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks