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.069MaRDI QIDQ877607zbMATH OpenOpenAlexFDO

Authors Dmitrii Lozovanu, Stefan Pickl

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

zbMATH Keywords

Nash equilibriaPareto optimamulti-objective controltime-discrete system\(c\)-game on networksmultiobjective gamesPareto-Nash equilibria

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Other game-theoretic models (91A40)

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

Cites work

• scientific article; zbMATH DE number 3782733 (Why is no real title available?)
• scientific article; zbMATH DE number 3535191 (Why is no real title available?)
• scientific article; zbMATH DE number 1994002 (Why is no real title available?)
• scientific article; zbMATH DE number 3307166 (Why is no real title available?)
• scientific article; zbMATH DE number 3351640 (Why is no real title available?)
• scientific article; zbMATH DE number 3397316 (Why is no real title available?)
• scientific article; zbMATH DE number 3084669 (Why is no real title available?)
• A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
• A note on two problems in connexion with graphs
• Controllability of a time-discrete dynamical system with the aid of the solution of an approximation problem
• Discrete optimal control problems and dynamic games with \(p\) players
• Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
• Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for \(k\)-partite networks
• Non-cooperative games
• 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

Cited in

(7)

• A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
• 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
• Controllability and Pareto improvability on Nash equilibriums in game-based control systems

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)