All rubbish. There's no need for a time-check. Here's a 2-cent algorithm:
- when any game ends, check if it is in a tournament. If not, we're done.
- if yes, check it's section for winner
- if there is a clear-cut winner for this section, check if all sections are done.

How to "check this section for winner":
- Find the highest score
- for all the other players in the section:
- - assume that all the unfinished games for the player will be wins.
- - if the new assumed score is higher than the "highest score" the section is not over.
- if for all the other players in the section the test is good, the section is over.

This algorithm costs almost nothing in performance. 3 "for" loops and a couple of ifs.
Why won't it work? because there's no one to implement it.