Authors: R. Boliac, Lozovanu Dmitrii
– 0.15 Mb
Abstract
We study the problem of finding optimal paths in network games with p players. Some polynomial-time algorithms for finding optimal paths and optimal by Nash strategies of the players in network games with p players are proposed.Rodica Boliac, Dumitru Lozovanu,
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev
2028, Moldova.
e-mail: ,
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev
2028, Moldova.
e-mail: ,
Fulltext
– 0.15 Mb
