Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for k-partite networks

MaRDI QIDQ2493326zbMATH OpenFDO

Authors Stefan Pickl, Dmitrii Lozovanu

Publication date 12 June 2006

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Positional games (pursuit and evasion, etc.) (91A24) Discrete-time games (91A50)

Cited in

(7)

• Algorithms for solving multiobjective discrete control problems and dynamic \(c\)-games on networks
• A constructive algorithm for max-min paths problems on energy networks
• Optimal Dynamic Multicommodity Flows in Networks
• scientific article; zbMATH DE number 2230247 (Why is no real title available?)
• 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
• 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

This page was built for publication: Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for \(k\)-partite networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493326)