Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Algorithms for finding optimal paths in network games with p players
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
Contents
- Information model of decision making process for image recognition
- Macroeconomic model of national economy development (extended)
- Models Nonlinear by Parameters
- Construction of complicated multifactor models of optimal form on the basis of statistical data, when the physical essence of phenomenon is known
- Provably indeterminate 128-bit cipher
- The approximate solution of singular integro-differential equations systems on smooth contours in spaces Lp
- The investigation of the algorithms of calculation of optical correlation functions
- An Algorithm for Solving Quadratic Programming Problems
- Algorithms for finding optimal paths in network games with p players
