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

Dmitrii Lozovanu and Stefan Pickl ()
Additional contact information
Dmitrii Lozovanu: Academy of Sciences of Moldova
Stefan Pickl: Universität der Bundeswehr

Chapter 2 in Optimization and Multiobjective Control of Time-Discrete Systems, 2009, pp 1-43 from Springer

Abstract: 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.

Keywords: Nash Equilibrium; Optimal Strategy; Directed Path; Polynomial Time Algorithm; Directed Cycle (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-85025-0_2

Ordering information: This item can be ordered from
http://www.springer.com/9783540850250

DOI: 10.1007/978-3-540-85025-0_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().