Abstract:
The problem of resolving a conflict of known multiplicity $k$ is considered. Recursive conflict-resolution strategy is proposed and investigated. It is shown that this strategy is optimal for $k=2$ and $k=3$. A comparison is made with the conflict-resolution algorithm of [B. S. Tsybakov and V. A. Mikhailov,Probl. Peredachi Inf., 1978, vol. 14, no. 4, pp. 32–59].
Fulltext:
PDF file (2031 kB)