Abstract:
We consider a hierarchical game for two players with possible errors in information exchanges. We compute the maximal guaranteed result for the top level player. We consider certain qualitative features of the resulting problems and discover their relation with coding theory problems.
Presented by the member of Editorial Board:D. A. Novikov