|
|
|
Публикации в базе данных Math-Net.Ru |
Цитирования |
|
2024 |
| 1. |
Dmitrii Lozovanu, “An optimality criterion for disjoint bilinear programming and its application to the problem with an acute-angled polytope for a disjoint subset”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2024, № 1-2, 109–136  |
|
2023 |
| 2. |
Dmitrii Lozovanu, Stefan Pickl, “On the existence of stationary Nash equilibria for mean payoff games on graphs”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2023, № 2, 41–51 |
|
2022 |
| 3. |
Dmitrii Lozovanu, Stefan Pickl, “Equilibria in pure strategies for a two-player zero-sum average stochastic positional game”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2022, № 1, 75–82  |
|
2021 |
| 4. |
Dmitrii Lozovanu, Stefan Pickl, “On the existence and determining stationary Nash equilibria for switching controller stochastic games”, Contributions to Game Theory and Management, 14 (2021), 290–301 |
|
2020 |
| 5. |
Alexandru Lazari, Dmitrii Lozovanu, “New algorithms for finding the limiting and differential matrices in Markov chains”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2020, № 1, 75–88 |
| 6. |
Dmitrii Lozovanu, Stefan Pickl, “On the existence of stationary Nash equilibria in average stochastic games with finite state and action spaces”, Contributions to Game Theory and Management, 13 (2020), 304–323 |
1
|
|
2019 |
| 7. |
Dmitrii Lozovanu, Stefan Pickl, “Pure stationary nash equilibria for discounted stochastic positional games”, Contributions to Game Theory and Management, 12 (2019), 246–260 |
1
|
|
2018 |
| 8. |
Dmitrii Lozovanu, Stefan Pickl, “An approach for determining the optimal strategies for an average Markov decision problem with finite state and action spaces”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2018, № 1, 34–49 |
| 9. |
Dmitrii Lozovanu, Stefan Pickl, “Nash equilibria in mixed stationary strategies for $m$-player mean payoff games on networks”, Contributions to Game Theory and Management, 11 (2018), 103–112 |
|
2017 |
| 10. |
Dmitrii Lozovanu, Stefan Pickl, “Stationary Nash equilibria for two-player average stochastic games with finite state and action spaces”, Contributions to Game Theory and Management, 10 (2017), 175–184 |
|
2016 |
| 11. |
Dmitrii Lozovanu, “Stationary Nash equilibria for average stochastic games with finite state and action spaces”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2016, № 2, 71–92 |
|
2015 |
| 12. |
Dmitrii Lozovanu, Stefan Pickl, “On Nash equilibria for stochastic games and determining the optimal strategies of the players”, Contributions to Game Theory and Management, 8 (2015), 187–198 |
2
|
|
2014 |
| 13. |
Dmitrii Lozovanu, Maria Capcelea, “Algorithms for solving stochastic discrete optimal control problems on networks”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2014, № 3, 80–88 |
| 14. |
Dmitrii Lozovanu, “Determining the optimal paths in networks with rated transition time costs”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2014, № 1, 14–22 |
| 15. |
Dmitrii Lozovanu, Stefan Pickl, “Nash equilibria conditions for stochastic positional games”, Contributions to Game Theory and Management, 7 (2014), 201–213 |
1
|
|
2011 |
| 16. |
Dmitrii Lozovanu, Stefan Pickl, “Algorithms for determining the state-time probabilities and the limit matrix in Markov chains”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2011, № 1, 66–82  |
|
2010 |
| 17. |
Dmitrii Lozovanu, Alexandru Lazari, “An approach for determining the matrix of limiting state probabilities in discrete Markov processes”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2010, № 1, 77–91 |
2
|
|
2009 |
| 18. |
Dmitrii Lozovanu, Stefan Pickl, “Dynamic programming algorithms for solving stochastic discrete control problems”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2009, № 2, 73–90 |
3
|
|
2008 |
| 19. |
Dmitrii Lozovanu, Alexandru Lazari, “Discrete Optimal Control Problem with Varying Time of States Transactions of Dynamical System and Algorithm for its solving”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2008, № 2, 46–53 |
|
2007 |
| 20. |
Dmitrii Lozovanu, “Parametrical Approach for Bilinear Programming and its Application for solving Integer and Combinatorial Optimization Problems”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2007, № 3, 91–101 |
| 21. |
Maria Fonoberova, Dmitrii Lozovanu, “Minimum Cost Multicommodity Flows in Dynamic Networks and Algorithms for their Finding”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2007, № 1, 107–119 |
|
2006 |
| 22. |
Dmitrii Lozovanu, Maria Fonoberova, “A Linear Parametrical Programming Approach for Studying and Solving Bilinear Programming Problem”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2006, № 3, 73–86 |
| 23. |
D. Drucioc, D. Lozovanu, M. Popovici, “Dynamic programming approach for solving discrete optimal control problem and its multicriterion version”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2006, № 1, 31–38 |
|
2005 |
| 24. |
D. Lozovanu, D. Solomon, A. Zelikovsky, “Multiobjective Games and Determining Pareto-Nash Equilibria”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2005, № 3, 115–122 |
10
|
| 25. |
M. Fonoberova, D. Lozovanu, “Optimal multicommodity flows in dynamic networks and algorithms for their finding”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2005, № 1, 19–34 |
1
|
|
2004 |
| 26. |
M. Fonoberova, D. Lozovanu, “The optimal flow in dynamic networks with nonlinear cost functions on edges”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2004, № 3, 10–16 |
1
|
| 27. |
Dmitrii Lozovanu, Stefan Pickl, “Discrete optimal control problems on networks and dynamic games with $\mathbf p$ players”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2004, № 2, 67–88 |
1
|
|
2001 |
| 28. |
Д. Д. Лозовану, “Сетевые модели дискретного оптимального управления и динамические игры с $p$ игроками”, Дискрет. матем., 13:4 (2001), 126–143 ; D. D. Lozovanu, “Network models of discrete optimal control, and dynamic games with $p$ players”, Discrete Math. Appl., 11:6 (2001), 625–642 |
3
|
|
1994 |
| 29. |
Д. Д. Лозовану, В. А. Трубин, “Задача о минимаксном пути в сети и алгоритм ее решения”, Дискрет. матем., 6:2 (1994), 138–144 ; D. D. Lozovanu, V. A. Trubin, “The problem of the minimax path in a network and an algorithm for its solution”, Discrete Math. Appl., 4:5 (1994), 447–453 |
3
|
|
