Discrete control and algorithms for solving antagonistic dynamic games on networks

DOI10.1080/02331930902819253zbMath1167.90396OpenAlexW2039373347MaRDI QIDQ3391895

Stefan Pickl, Dmitrii D. Lozovanu

Publication date: 13 August 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930902819253

zbMATH Keywords

positional gamesmax-min path\(c\)-game on financial networksantagonistic dynamic gamemax-min control problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (2)

Novel inequalities for generalized graph entropies -- graph energies and topological indices ⋮ Electricity supply chain coordination with carbon abatement technology investment under the benchmarking mechanism

Cites Work

• 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
• Positional strategies for mean payoff games
• The complexity of mean payoff games on graphs
• Optimal paths in network games with \(p\) players
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• Integer Programming and Combinatorial Optimization

This page was built for publication: Discrete control and algorithms for solving antagonistic dynamic games on networks