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
DOI10.1016/J.EJOR.2005.10.069zbMATH Open1123.90066OpenAlexW1968410160MaRDI QIDQ877607FDOQ877607
Stefan Pickl, Dmitrii Lozovanu
Publication date: 3 May 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.069
Recommendations
- Multiobjective control of time-discrete systems and dynamic games on networks
- Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
- scientific article; zbMATH DE number 2170590
- A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
- Nash equilibria for the multiobjective control of linear partial differential equations
Nash equilibriaPareto optimamulti-objective controltime-discrete system\(c\)-game on networksmultiobjective gamesPareto-Nash equilibria
Cites Work
- A note on two problems in connexion with graphs
- Non-cooperative games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Discrete optimal control problems and dynamic games with \(p\) players
- Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for \(k\)-partite networks
- Time dependency in multiple objective dynamic programming
- Title not available (Why is that?)
- Optimal paths in network games with \(p\) players
- A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
- Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
- Title not available (Why is that?)
- Controllability of a time-discrete dynamical system with the aid of the solution of an approximation problem
- Title not available (Why is that?)
Cited In (6)
- Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
- 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
- Multiobjective control of time-discrete systems and dynamic games on networks
- Nash equilibrium in multi-player games with the choice of time instants and integral cost functionals
- Discrete control and algorithms for solving antagonistic dynamic games on networks
- A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877607)
