Dmitrii Lozovanu

Orcid: 0000-0002-5953-570X

According to our database1, Dmitrii Lozovanu authored at least 41 papers between 1995 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Determining Nash Equilibria for Stochastic Positional Games with Discounted Payoffs.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016
Determining the Optimal Strategies for Zero-Sum Average Stochastic Positional Games.
Electron. Notes Discret. Math., 2016

2015
Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs.
Discret. Appl. Math., 2015

Determining the Optimal Strategies for Stochastic Positional Games with Discounted Payoffs.
Proceedings of the 20th International Conference on Control Systems and Computer Science, 2015

Determining Nash Equilibria for Dynamic Positional Games on Networks.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013
Optimal paths in networks with rated transition time costs.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Nash Equilibria Conditions for Stochastic Cyclic Games on Networks.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
The game-theoretical approach to Markov decision problems and determining Nash equilibria for stochastic positional games.
Int. J. Math. Model. Numer. Optimisation, 2011

Determining the Optimal Strategies for Antagonistic Positional Games in Markov Decision Processes.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

Discounted Markov Decision Processes and Algorithms for Solving Stochastic Control Problem on Networks.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Optimal stationary control of discrete processes and a polynomial time algorithm for stochastic control problem on networks.
Proceedings of the International Conference on Computational Science, 2010

Determining Optimal Stationary Strategies for Discounted Stochastic Optimal Control Problem on Networks.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool.
Central Eur. J. Oper. Res., 2009

Algorithmic Solutions of Discrete Control Problems on Stochastic Networks.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
A constructive algorithm for max-min paths problems on energy networks.
Appl. Math. Comput., 2008

2007
Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic c.
Eur. J. Oper. Res., 2007

Algorithms for solving multiobjective discrete control problems and dynamic c-games on networks.
Discret. Appl. Math., 2007

Multiobjective hierarchical control of time-discrete systems and dtermining Stackelberg strategies.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
Nash Equilibria Conditions for Cyclic Games with p Players.
Electron. Notes Discret. Math., 2006

Optimal Dynamic Multicommodity Flows in Networks.
Electron. Notes Discret. Math., 2006

An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension.
Central Eur. J. Oper. Res., 2006

2005
Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games.
Comput. Sci. J. Moldova, 2005

Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks.
Comput. Sci. J. Moldova, 2005

The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving.
Comput. Sci. J. Moldova, 2005

2004
A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks.
Electron. Notes Discret. Math., 2004

The maximum flow in dynamic networks.
Comput. Sci. J. Moldova, 2004

Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003
Polynomial Time Algorithms for Determining Optimal Strategies.
Electron. Notes Discret. Math., 2003

Polynomial time algorithm for solving cyclic games.
Comput. Sci. J. Moldova, 2003

2002
A note on the colorability of mixed hypergraph using k colors.
Comput. Sci. J. Moldova, 2002

An algorithm for solving the transport problem on network with concave cost functions of flow on edges.
Comput. Sci. J. Moldova, 2002

Discrete Control Processes, Dynamic Games and Multicriterion Control.
Comput. Sci. J. Moldova, 2002

Algorithms for solving discrete control problems on networks.
Comput. Sci. J. Moldova, 2002

Optimal flow in dynamic networks with nonlinear cost functions on edges.
Proceedings of the Analysis and Optimization of Differential Systems, 2002

2001
Discrete optimal control problems and dynamic games with p players.
Electron. Notes Discret. Math., 2001

A generalization of the optimality for multicriterion problems.
Comput. Sci. J. Moldova, 2001

2000
Optimal Paths in Network Games with P Players.
Discret. Appl. Math., 2000

Integer programming models for colorings of mixed hypergraphs.
Comput. Sci. J. Moldova, 2000

1998
Algorithms for finding the minimum cycle mean in the weighted directed graph.
Comput. Sci. J. Moldova, 1998

1997
Algorithms for finding optimal paths in network games with p players.
Comput. Sci. J. Moldova, 1997

1995
The problem of the synthesis of a transport network with a single source and the algorithm for its solution.
Comput. Sci. J. Moldova, 1995


  Loading...