A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
From MaRDI portal
Publication:3439155
Recommendations
- Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
- Multiobjective control of time-discrete systems and dynamic games on networks
- scientific article; zbMATH DE number 2170590
- 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
- Optimization and Multiobjective Control of Time-Discrete Systems
Cites work
Cited in
(8)- Nash Equilibria Conditions for Cyclic Games with p Players
- Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
- Multiobjective control of time-discrete systems and dynamic games on networks
- Optimization and Multiobjective Control of Time-Discrete Systems
- 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
- A constructive algorithm for max-min paths problems on energy networks
- Discrete control processes, dynamic games and multicriterion control problems.
- An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension
This page was built for publication: A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439155)