Effective algorithms for games with prohibitions and their applications

In this paper, a polynomial algorithm of solving games with prohibitions with a uniform functional over a loop for strongly ergodic game networks. We give the criterion of strong ergodicity of a simple network and show that the definition of strong ergodicity is a co-NP-complete problem. The games with prohibitions are interpreted in the context of problems of scheduling theory with logical conditions of preceding.