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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
