Skip to main content
Log in

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

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Bellman R, Kalaba R (1965) Dynamic programming and modern control theory. Academic, New York and London

    Google Scholar 

  • Boltyanskii VG (1973) Optimal control of discrete systems. Nauca, Moscow

    Google Scholar 

  • Boliac R, Lozovanu D, Solomon D (2000) Optimal paths in network games with p players. Discret Appl Math 99(1–3):339–348

    Article  Google Scholar 

  • Boros E, Gurvich V, (2002) On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. DIMACS Technical Report, 18, pp 1–32

  • Feichtinger G, Hartl RF (1986) Optimale Kontrolle Ökonomischer Prozesse. Anwendung des in den Wirtschaftswissenschaften. de Gruyter Verlag, Berlin

  • Krabs W, Pickl S (2003) Analysis, controllability and optimization of time-discrete systems and dynamical games, lecture notes in economics and mathematical systems. Springer, Berlin New York

    Google Scholar 

  • Lozovanu D, Pickl S (2004) A special dynamic programming technique for multiobjective discrete control and for dynamic games on graph-based networks, CTW Workshop on Graphs and Combinatorial Optimization, Milano, pp 184–188

  • Lozovanu D, Pickl S (2005) Nash equilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for k-partite networks. Central Eur J Oper Res 113(2):127–146

    Google Scholar 

  • Lozovanu D (2001) Network models of discrete optimal control problems and dynamic games with p players. Discret Math Appl 4(13):126–143

    Google Scholar 

  • Lozovanu D, Pickl S (2003) Polynomial time algorithms for determining optimal strategies. Electron Notes Discret Math 13:154–158

    Google Scholar 

  • Nash JF (1951) Non cooperative games. Ann Math 2:286–295

    Article  Google Scholar 

  • Weber G-W (1999/2000) Generalized Semi-Infinite Optimization and Related Topics, habilitation thesis, Darmstadt University of Technology, Department of Mathematics

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dmitrii Lozovanu.

Additional information

Dmitrii Lozovanu was Supported by BGP CRDF-MRDA MOM2-3049-CS-03.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lozovanu, D., Pickl, S. An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension. cent.eur.j.oper.res. 14, 357–375 (2006). https://doi.org/10.1007/s10100-006-0010-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-006-0010-y

Keywords

Navigation