RO EN
Polynomial time algorithm for solving cyclic games
Authors: Lozovanu Dmitrii
– 0.18 Mb
Abstract
The problem of finding the value and optimal strategies of players in cyclic games is studied. A polynomial time algorithm for solving cyclic games is proposed.D.Lozovanu,
Institute of Mathematics and Computer Science,
Academy of Sciences of Moldova,
str. Academiei, 5, Chishinau, MD-2028,
Republic of Moldova
E-mail:
Institute of Mathematics and Computer Science,
Academy of Sciences of Moldova,
str. Academiei, 5, Chishinau, MD-2028,
Republic of Moldova
E-mail:
Fulltext
– 0.18 Mb
Contents
- Polynomial time algorithm for solving cyclic games
- Gray Code for Cayley Permutations
- Quasi-stability of a vector trajectorial problem with non-linear partial criteria
- Finite fields and cryptology
- Mobile Communications World: Security Implementations Aspects - A State of the Art
- Combined Randomized-Local Hough Transform versus UpWrite Transform in stamp detection
- Lower Bounds and Semi On-line Multiprocessor Scheduling
