An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension

DOI10.1007/s10100-006-0010-yzbMath1116.49020OpenAlexW2034808443MaRDI QIDQ882601

Stefan Pickl, Dmitrii D. Lozovanu

Publication date: 24 May 2007

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-006-0010-y

zbMATH Keywords

dynamic programmingNash equilibriadynamic networksdiscrete optimal controlalgorithmic solutiongame-theoretic procedure

Mathematics Subject Classification ID

Noncooperative games (91A10) Dynamic programming in optimal control and differential games (49L20) Applications of optimal control and differential games (49N90) Dynamic programming (90C39)

Related Items (1)

Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis, controllability and optimization of time-discrete systems and dynamical games.
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• Optimal paths in network games with \(p\) players
• Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for \(k\)-partite networks
• Non-cooperative games
• A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
• Network models of discrete optimal control and dynamic games with p players
• ON A NEW APPROACH TO THE NUMERICAL SOLUTION OF A CLASS OF PARTIAL DIFFERENTIAL INTEGRAL EQUATIONS OF TRANSPORT THEORY

This page was built for publication: An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension