Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for \(k\)-partite networks
From MaRDI portal
Publication:2493326
zbMath1136.90468MaRDI QIDQ2493326
Stefan Pickl, Dmitrii D. Lozovanu
Publication date: 12 June 2006
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Discrete-time games (91A50) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (6)
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 ⋮ An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension ⋮ 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 ⋮ A constructive algorithm for max-min paths problems on energy networks ⋮ Unnamed Item ⋮ Optimal Dynamic Multicommodity Flows in Networks
This page was built for publication: Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for \(k\)-partite networks
