The decentralized stochastic multi-player multi-armed bandit (MP-MAB) problem, where the collision information is not available to the players, is studied in this paper. Building on the seminal work of Boursier and Perchet (2019), we propose error correction synchronization involving communication (EC-SIC), whose regret is shown to approach that of the centralized stochastic MP-MAB with collision information. By recognizing that the communication phase without collision information corresponds to the Z-channel model in information theory, the proposed EC-SIC algorithm applies optimal error correction coding for the communication of reward statistics. A fixed message length, as opposed to the logarithmically growing one in Boursier and Perchet (2019), also plays a crucial role in controlling the communication loss. Experiments with practical Z-channel codes, such as repetition code, flip code and modified Hamming code, demonstrate the superiority of EC-SIC in both synthetic and real-world datasets.

本文研究了无碰撞信息的分布式随机多人多臂老虎机（MP-MAB）问题。提出了基于误差校正同步（EC-SIC）的算法，通过使用Z通道模型的最优纠错编码来通信奖励统计信息，实现分布式随机MP-MAB的遗憾率接近中心化情况下的遗憾率的效果。经过实验，证明EC-SIC算法在合成和真实数据集上都优于重复码、翻转码和修改的汉明码等实用Z通道编码。

无碰撞信息的去中心化多人多臂赌博机