A cops and robber game and the meeting time of synchronous directed walks

In a previous work, the authors showed that the maximum number of infinitely long synchronous directed walks that never meet is equal to the dimension (Formula presented.) of the no-meet matroid, namely the largest order of a collection of vertex-disjoint cycles. Given (Formula presented.), we want to compute the meeting time of (Formula presented.) walks: the first time step (Formula presented.) such that, given any set of (Formula presented.) walks, at least two of them must meet no later than (Formula presented.). We precisely prove that the meeting time is at most (Formula presented.), where (Formula presented.) is the number of vertices. A connection is established with a cops and robber game on directed graphs with helicopter cops and an invisible slow robber. The meeting time of (Formula presented.) walks equals the capture time in this game, when at most (Formula presented.) capture attempts are allowed. While this capture time can be computed in polynomial time, we show that it is NP-hard to compute the minimum number of cops (Formula presented.) needed to catch the robber. More insights are also given on the number (Formula presented.) and its relation to pathwidth and other graph parameters. Finally we analyze these game measures on digraph tensor products.