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
From MaRDI portal
Publication:877607
DOI10.1016/j.ejor.2005.10.069zbMath1123.90066OpenAlexW1968410160MaRDI QIDQ877607
Stefan Pickl, Dmitrii D. 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
Nash equilibriaPareto optimamulti-objective controltime-discrete system\(c\)-game on networksmultiobjective gamesPareto-Nash equilibria
Related Items (3)
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 ⋮ Discrete control and algorithms for solving antagonistic dynamic games on networks
Cites Work
- A note on two problems in connexion with graphs
- 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
- Time dependency in multiple objective dynamic programming
- 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
- Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
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
