Max-Min Control Problems and Solving Zero-Sum Games on Networks

  • Dmitrii Lozovanu
  • Stefan Pickl

The mathematical tool we develop in this chapter allows us to derive methods and algorithms for solving max-min discrete control problems and to determine optimal stationary strategies of the players in dynamic zero-sum games on networks. We propose polynomial-time algorithms for finding max-min paths on networks and determining optimal strategies of players in antagonistic positional games. These algorithms are applied for studying and solving cyclic games. The computational complexity of the proposed algorithms is analyzed.


Nash Equilibrium Optimal Strategy Directed Path Polynomial Time Algorithm Directed Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Dmitrii Lozovanu
    • 1
  • Stefan Pickl
    • 2
  1. 1.Academy of Sciences of MoldovaChisinauMoldova
  2. 2.Universität der BundeswehrMünchenGermany

Personalised recommendations