An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension

An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension

0.00 Avg rating0 Votes
Article ID: iaor20073173
Country: Germany
Volume: 14
Issue: 4
Start Page Number: 357
End Page Number: 375
Publication Date: Dec 2006
Journal: Central European Journal of Operations Research
Authors: ,
Keywords: game theory, programming: dynamic
Abstract:

We consider time discrete systems which are described by a system of difference equations. The related discrete optimal control problems are introduced. Additionally, a gametheoretic extension is derived, which leads to general multicriteria decision problems. The characterization of their optimal behavior is studied. Given starting and final states define the decision process; applying dynamic programming techniques suitable optimal solutions can be gained. We generalize that approach to a special gametheoretic decision procedure on networks. We characterize Nash equilibria and present sufficient conditions for their existence. A constructive algorithm is derived. The sufficient conditions are exploited to get the algorithmic solution. Its complexity analysis is presented and at the end we conclude with an extension to the complementary case of Pareto optima.

Reviews

Required fields are marked *. Your email address will not be published.