A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks

DOI10.1016/J.ENDM.2004.03.041zbMath1152.90642OpenAlexW2034949806MaRDI QIDQ3439155

Stefan Pickl, Dmitrii D. Lozovanu

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.041

zbMATH Keywords

networkc-gamespolynomial time-algorithm

Mathematics Subject Classification ID

Dynamic programming (90C39) Dynamic games (91A25) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

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 ⋮ An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension ⋮ A constructive algorithm for max-min paths problems on energy networks ⋮ Nash Equilibria Conditions for Cyclic Games with p Players

Cites Work

• Unnamed Item
• Unnamed Item
• Non-cooperative games
• Network models of discrete optimal control and dynamic games with p players

This page was built for publication: A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks