Maximal strategies in n-state fully controllable nondeterministic or stochastic graphs admit at least (n-1)! action-release sequences of length >= n-1 that delay full identification until the final revelation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deception, Delay, and Detection of Strategies
Maximal strategies in n-state fully controllable nondeterministic or stochastic graphs admit at least (n-1)! action-release sequences of length >= n-1 that delay full identification until the final revelation.