Discrete control and algorithms for solving antagonistic dynamic games on networks

References

• Bellman , R and Kalaba , R . 1965 . Dynamic Programming and Modern Control Theory , New York, London : Academic Press .
   Google Scholar
• Boliac , R , Lozovanu , D and Solomon , D . 2000 . Optimal paths in network games with p players . Discr. Appl. Math. , 99 : 339 – 348 .
   Web of Science ®Google Scholar
• Boltjanski , WG . 1976 . Optimale Steuerung diskreter Systeme , Leipzig : Leipzig Akademische Verlagsgesellschaft Geest & Portig K.-G. .
   Google Scholar
• Christofides , N . 1975 . Graph Theory: An Algorithmic Approach , London : Academic Press .
   Google Scholar
• Ehrenfeucht , A and Mycielski , J . 1979 . Positional strategies for mean payoff games . J. Game Theory , 8 : 109 – 113 .
   Google Scholar
• Grimm , B , Pickl , S and Reed , A . 2003 . “ Management and Optimization of Environmental Data within Emission Trading Markets-VEREGISTER AND TEMPI ” . In Emission Trading and Business , Edited by: Antes , R , Hansjürgens , B and Letmathe (Hrsg.) , P . 165 – 176 . HD : Physica Verlag .
   Google Scholar
• Gurvich , VA , Karzanov , AV and Khachiyan , LG . 1988 . Cyclic games and an algorithm to find minmax cycle means in directed graphs . USSR, Comput. Math. and Math. Phys. , 28 : 85 – 91 .
   Web of Science ®Google Scholar
• Krabs , W and Pickl , S . 2003 . Analysis, Controllability and Optimization of Time-Discrete Systems and Dynamical Games , Berlin, Heidelberg : Lecture Notes in Economics and Mathematical Systems, Springer Verlag .
   Google Scholar
• Lozovanu , D . 1991 . Algorithms to solve some classes of network minmax problems and their applications . Cybernetics , 29 : 93 – 100 .
   Google Scholar
• D. Lozovanu, Polynomial time algorithm for determining optimal strategies in cyclic games, 10th International IPCO Conference, New York, 2004 (Proceedings), pp. 74–85
   Google Scholar
• Lozovanu , D . 2005 . Polynomial time algorithm for determining max–min paths in networks and solving zero value cyclic games . Comp. Sci. J. Moldova , 2 : 13 – 28 .
   Google Scholar
• Lozovanu , D and Pickl , S . 2005 . Nash Equilibria for Multiobjective Control of Time-Discrete Systems and a Polynomial-Time Algorithm for k-Partite Networks . Central Eur. J. Op. Res. , 2 : 127 – 146 .
   Google Scholar
• Lozovanu , D and Pickl , S . 2004 . A special dynamic programming technique for multiobjective discrete control and for dynamic games on graph-based networks . Elect. Notes Discr. Math. , 17 : 183 – 188 .
   Google Scholar
• Lozovanu , D and Pickl , S . 2007 . 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 . Eur. J. Op. Res. , 181 : 1214 – 1232 .
   Web of Science ®Google Scholar
• D. Lozovanu, S. Pickl and G.-W. Weber, Optimization, monotonicity and the determination of Nash-equilibria. An algorithmic analysis computing anticipatory systems, Computing Anticipatory Systems–Proceedings Sixth International Conference, CASYS 2003, 2004, pp. 351–382
   Google Scholar
• Meyer-Nieberg , S and Pickl , S . 2003 . “ Simulation eines CO2-Zertifikatenhandels und algorithmische Optimierung von Investitionen ” . In Operations Research Proceedings 2002 (Selected Papers) Berlin , 471 – 474 . Heidelberg : Springer Verlag .
   Google Scholar
• Neumann , J and Morgenstern , O . 1953 . Theory of Games and Economic Behaviour , Princton : Princeton University Press .
   Google Scholar
• Pickl , S . 1998 . “ Der τ-value als Kontrollparameter–Modellierung und Analyse eines Joint-Implementation Programmes mithilfe der dynamischen kooperativen Spieltheorie und der diskreten Optimierung ” . In Doctoral Thesis , Darmstadt University of Technology, Department of Mathematics .
   Google Scholar
• Zwick , U and Paterson , M . 1996 . The complexity of mean payoff games on graphs . TCS , 158 : 344 – 359 .
   Web of Science ®Google Scholar