• Structura
• Colaboratori
• Publicaţii
• Proiecte
• Doctorat
• Conferinţe
• Noutăţi
• Ştiri Europene
• Comitetul Sindical

Titluri: doctor habilitat, profesor universitar Postul: cercetător ştiinţific principal Data naşterii: 8 noiembrie 1948 Lucrări: 170 Limbi străine: Rusa, Engleza Telefon: 73-35-83 Fax: 73-80-27 Email:

Curriculum Vitae

Descarcă

Domeniul de cercetare

Optimizarea discretă, analiza şi proiectarea algoritmilor, teoria jocurilor şi controlul optimal

Lucrări importante

• On the existence of stationary Nash equilibria for mean payoff games on graphs.
  Lozovanu, D., Pickl, S., Bul. Acad. Rep. Mold. , Mat. 2023, @(102), p 41-51, ISSN 1024-7696.
• Markov Decision Processes and Stochastic Positional Games.
  Lozovanu, D., Pickl, S., Springer, 2023, 396 p. ISBN 978-3-031-40179-4.
• Pure and mixed stationary Nash equilibria for dynamic positional games on graphs.
  Lozovanu, D., Pickl, S. Proceedings of 19th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Munchen. Germany, 2023, pp 53-56.
• Optimal stationary strategies for stochastic positional games.
  Lozovanu D. Abstracts of International Conference "Mathematics and Information Technologies: Research and Education", Chisinau, Republic of Moldova, June 26 - 29, 2023, p. 65 — 66.
• On Determining stationary Nash equilibria for single controller stochastic games.
  Lozovanu, D. Abstract of Int. conf. Mathematics and IT, dedicated 75th anniversary of Moldova State University, July 1-3, p 51-52.,2021.
• An approach for determining stationary equilibria in a single-controller average stochastic game.
  Lozovanu D., Pickl S. Chapter * in the book : Frontiers in Dynamic Games (L. Petrosyan at al. eds.), Springer, pp !57-171, 2021, ISBN 978-3-030-23698-4.
• On the existence and determining stationary Nash equilibria for switching controller stochastic games.
  Lozovanu D., Pickl S. Contributions to Game Theory and Management, St Petersburg State University, vol. 14, pp 284-296, 2021, ISBN 2310-2608.
• On the existence of stationary Nash equilibria in average stochastic games with finite state and action spaces.
  Lozovanu D., Pickl S. Contributions to Game Theory and Management, St. Petersburg State University, vol. 13, pp 304-323, 2020, ISBN 978-3-030-23698-4.
• Pure and mixed stationary Nash equilibria for average stochastic positional games.
  Lozovanu D. Chapter * in the book: Frontiers of Dynamic Games (L. Petrosyan et al. eds), Springer, pp131-156, 2019, ISBN 978-3-030-23698-4.
• Stationary Nash equilibria for average stochastic positional games.
  Lozovanu D. Chapter no. 9 in the book: Frontiers of Dynamic Games (L. Petrosyan et al eds.). Springer, 139-163, 2018. ISSN 2363-8516.
• Nash equilibria in mixed stationary strategies for m-player mean payoff games on networks.
  Lozovanu D., Pickl S. Contributions to Game Theory and Management, St.Petersburg, vol. XI, 103-112, 2018. ISSN 2310-2608.
• Optimization of Stochastic Discrete Systems and Control on Complex Networks.
  Lozovanu D., Pickl S. Springer, 2015, 400 p. ISBN: 978-3-319-11832-1.
• Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs.
  Lozovanu D., Pickl S. Discrete Applied Mathematics v. 182, 2015, 169-180.
• On Nash equilibria in stochastic positional games with average payoffs.
  Lozovanu D., Pickl S. Optimization, Control, and Applications in the Information Age (in Honor of Panos M. Pardalos’s 60th Birthday), Springer, Proceedings in Mathematics and Statistics, v. 130,p. 171-186, 2015.
• Nash Equilibria Conditions for Stochastic Positional Games.
  Lozovanu D., Pickl S. Contribution to Game Theory and Managment (Ed.: A. Pertosyan, N. Zenkevich), St. Petersburg University, Vol. 7, 2014, p 204 -219.
• Saddle point conditions for abtagonistic positional games in complex decision processes.
  Lozovanu D., Pickl S. Int. Journal of Computing Anticipatory Systems, v. 26, 2012, 188-194.
• The game-theoretical approach to Markov decision problems and determining Nash equilibria for stochastic positional games.
  Dmitrii Lozovanu Int. Journal of Mathematical Modelling and Numerical Optimization., 2, (2), 2011, pp. 162-174.
• A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains.
  Stefan Pickl, Dmitrii Lozovanu Optimization., 60 (10), 2011, pp. 1339-1358.
• Algorithms for solving discrete optimal control problems with varying time of states’ transitions of dynamical system.
  Dmitrii Lozovanu, Stefan Pickl Dynamics of Continuous, Discrete and Inpulsive Systems, ser. B: Applications and Algorithms, 17, 2010, pp. 101-111.
• Discrete control and algorithms for solving antagonistic dynamic games on networks.
  Dmitrii Lozovanu, Stefan Pickl Optimization, 58 (6), 2009, pp. 665-683.
• Optimization and Multiobjective controlof Time-Discrete Systems.
  Dmitrii Lozovanu, Stefan Pickl Springer, London, 2009, 285 p. (Monograph).
• Algorithms for solving discrete optimal control problems with infinite time horizon and dtermining minimal mean cost cycles in a directed graph as decision support tool.
  Dmitrii Lozovanu, Stefan Pickl Central European Journal of Operations Research. 17(3), 2009, pp. 255-264.
• A constructive algorithm for max-min path problem on energy networks.
  Dmitrii Lozovanu, Stefan Pickl Applied Mathematics and Computations., 204 (2), 2008, pp. 602-609.
• Multiobjective Control of Time-Discrete Sytems and Dynamic Gasmes on Networks.
  Dmitrii Lozovanu Chapter in the book: Pareto Optimality, Game Theory and Equilibria (edited by A. Chinchuluun, P. Pardalos), Spriger, 2008, pp. 665-756.
• Algorithms and the calculation of Nash Ecuilibria for multiobjective control of time-discrete systems and polynomial-time algorithms for dynsamic c-game on networks.
  Dmitrii Lozovanu, Stefan Pickl European Journal of Operational Research, 181, 2007, pp. 1214-1232.
• Algorithms for solving multiobjective discrete control problems and dynamic c-games on networks.
  Dmitrii Lozovanu, Stefan Pickl Discrete Applied Mathematics, 155, (14), 2007, pp. 1846-1857.
• Nash Equilibria for Multiobjective Control of Time-Discrete Systems and Polynomial-Time Algorithm for k-partite Networks.
  Dmitrii Lozovanu, Stefan Pickl Central European Journal of Operation Research 13(2), 2005, pp. 127-146.
• Polynomial time algorithm for determining optimal strategies in cyclic games.
  Dmitrii Lozovanu IPCO 2004 Conference Proceedings, New York, Springer, 2004, pp. 74-85.
• Networks models of discrete optimal control and dynamic games with p players.
  Dmitrii Lozovanu Discrete Mathematics and Applications, 13, 4, 2001, pp. 126-143.
• Optimal paths in network games with p players.
  D. Lozovanu, R. Boliac, D. Solomon Discrete Applied Mathematics, 99, 1-3, 2000, pp. 339-348.

Apartenenţa la societăţi, redacţii

• Societatea Matematică din Republica Moldova (SMRM).
• Membru Colegiului de Redacţie a revistei „Buletinul Academiei de ştiinţe al Republicii Moldova. Matematica”.
• Membru Colegiului de Redacţie a revistei „Computer Science Journal of Moldova”.

Distincţii

• Premiu de Stat in Domeniul ştiinţei, Tehnicii şi Producţiei (1998).
• Premiu „Best Paper Award” la simposionul „Computing Systems, Discrete Models, Algorithm, Simulation, Information Systems, Networks” pentru contribuţia „Optimization, Monotonicity and the Determination of Nash Equilibria – An Algorithmic Analysis”, CASYS’03 Liege, Belgium, August 11-16, 2003.
• Laureat al premiului academicianului Sibirsky (2004).
• Premiu Academiei de Ştiinţe a Moldovei (2006).
• Premiu "Savantul Anului" (2009).

Publicaţii în Computer Science Journal of Moldova, Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica şi Quasigroups and Related Systems

• 2024 An optimality criterion for disjoint bilinear programming and its application to the problem with an acute-angled polytope for a disjoint subset
• 2023 On the Existence of Stationary Nash Equilibria for Mean Payoff Games on Graphs
• 2022 Equilibria in Pure Strategies for a Two-Player Zero-Sum Average Stochastic Positional Game
• 2020 New Algorithms for Finding the Limiting and Differential Matrices in Markov Chains
• 2018 An Approach for Determining the Optimal Strategies for an Average Markov Decision Problem with Finite State and Action Spaces
• 2016 Stationary Nash Equilibria for Average Stochastic Games with Finite State and Action Spaces
• 2014 Algorithms for solving stochastic discrete optimal control problems on networks
• 2014 Determining the Optimal Paths in Networks with Rated Transition Time Costs
• 2011 Algorithms for Determining the State-Time Probabilities and the Limit Matrix in Markov Chains
• 2010 An Approach for Determining the Matrix of Limiting State Probabilities in Discrete Markov Processes.
• 2009 Dynamic Programming Algorithms for Solving Stochastic Discrete Control Problems.
• 2008 Discrete Optimal Control Problem with Varying Time of States Transactions of Dynamical System and Algorithm for its solving.
• 2007 Parametrical Approach for Bilinear Programming and its Application for solving Integer and Combinatorial Optimization Problems.
• 2007 Minimum Cost Multicommodity Flows in Dynamic Networks and Algorithms for their Finding.
• 2006 A Linear Parametrical Programming Approach for Studying and Solving Bilinear Programming Problem.
• 2006 Dynamic Programming Approach for Solving Discrete Optimal Control Problem and its Multicriterion Version.
• 2005 Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games
• 2005 Multiobjective Games and Determining Pareto-Nash Equilibria.
• 2005 Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks
• 2005 The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• 2005 Optimal multicommodity flows in dynamic networks and algorithms for their finding.
• 2004 The maximum flow in dynamic networks
• 2004 The optimal flow in dynamic networks with nonlinear cost functions on edges. (English)
• 2004 Discrete optimal control problems on networks and dynamic games with p players.
• 2003 Polynomial time algorithm for solving cyclic games
• 2002 Algorithms for finding the optimal strategies in dynamic games on networks. (English)
• 2002 Algorithms for solving discrete control problems on networks
• 2002 An algorithm for solving the transport problem on network with concave cost functions of flow on edges
• 2002 Discrete Control Processes, Dynamic Games and Multicriterion Control
• 2002 A generalization of the knapsack problem and finding the k-optimal tree in a weighted digraph. (English)
• 2002 A note on the colorability of mixed hypergraph using k colors
• 2001 The minimum-cost flow problem on dynamic networks and an algorithm for its solving.
• 2001 A generalization of the optimality for multicriterion problems
• 2000 An extension of the optimality notion for multicriterion problems. (English)
• 2000 Integer programming models for colorings of mixed hypergraphs
• 2000 Dynamic games with $p$ players on networks. (English)
• 1999 Optimal paths in dynamic networks. (English)
• 1998 Algorithms for finding the minimum cycle mean in the weighted directed graph
• 1997 Algorithms for finding optimal paths in network games with p players
• 1996 A network transportation problem with concave cost functions of the flow on network edges, and its applications. (Russian)
• 1996 Determination of the tree of minimax paths in a weighted digraph. (Russian)
• 1995 The problem of the synthesis of a transport network with a single source and the algorithm for its solution
• 1994 Algorithms of choice of optimal configurations in weighted digraphs. (Russian)
• 1993 On solution of problems of integer programming. (Russian)
• 1992 On a parametrical method for solving bicriterion max-min fractional problems. (English)
• 1991 On the search for minimax paths in networks. (Russian)
• 1990 Use of the embeddability properties of polyhedral sets in the study and solution of some special classes of problems. (Russian)
• 1990 Maximin linear problems with connected variables and their applications to the study and solution of cyclic games. (Russian)

 

Copyright © 2001–2025 Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Tel: (373 22) 72-59-82, Fax: (373 22) 73-80-27, Email:
Adresa: MD 2028, Chişinău, str. Academiei 5