Lower bound for the advantage coefficient in the search problem on graphs

We obtain a lower bound for the pursuing (searching) point velocity for which the minimax dynamic graph search problem in N.N. Petrov’s setting is solvable.

Ҳали таржима қилинмаган