Optimization and Multiobjective Control of Time-Discrete Systems
DOI10.1007/978-3-540-85025-0zbMATH Open1166.93001OpenAlexW2495805295MaRDI QIDQ3528115FDOQ3528115
Authors: Stefan Pickl, Dmitrii Lozovanu 
Publication date: 6 October 2008
Full work available at URL: https://doi.org/10.1007/978-3-540-85025-0
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
- A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
- Multilayered network games: algorithms for solving discrete optimal control problems with infinite time horizon via minimal mean cost cycles and a game-theoretical approach
- scientific article; zbMATH DE number 2170590
Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Applications of game theory (91A80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Applications of optimal control and differential games (49N90) Hierarchical systems (93A13) Discrete-time control/observation systems (93C55) Research exposition (monographs, survey articles) pertaining to systems and control theory (93-02) Research exposition (monographs, survey articles) pertaining to difference and functional equations (39-02)
Cited In (12)
- Analysis, controllability and optimization of time-discrete systems and dynamical games.
- 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
- An approach for determining stationary equilibria in a single-controller average stochastic game
- Linear discrete-time set-valued Pareto-Nash-Stackelberg control processes and their principles
- Multiobjective control of time-discrete systems and dynamic games on networks
- Multilayered network games: algorithms for solving discrete optimal control problems with infinite time horizon via minimal mean cost cycles and a game-theoretical approach
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria
- Equilibria in pure strategies for a two-player zero-sum average stochastic positional game
- On Nash equilibria in stochastic positional games with average payoffs
- Determining the optimal strategies for zero-sum average stochastic positional games
- A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains
- A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
This page was built for publication: Optimization and Multiobjective Control of Time-Discrete Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528115)
