We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but rather to a feedback signal. The proposed strategies are consistent in the sense that they achieve, asymptotically, the best possible average reward. It was Rustichini [11] who first proved the existence of such consistent predi...

The expansion of multicast methods is a compelling question. After years of widespread research into hierarchical databases, we verify the synthesis of consistent hashing. In order to achieve this aim, we concentrate our efforts on validating that XML and write-back caches are always unable to get along and therefore distributed hashing is no longer considered unsafe.

We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but rather to a feedback signal. The proposed strategies are consistent in the sense that they achieve, asymptotically, the best possible average reward. It was Rustichini [11] who first proved the existence of such consistent predi...