Strategic Arms with Side Communication Prevail Over Low-Regret MAB Algorithms

Ahmed Ben Yahmed, Clément Calauzènes, Vianney Perchet
8/30/2024
cs.AI

No confident code implementation found for this paper.

Abstract

In the strategic multi-armed bandit setting, when arms possess perfect information about the player's behavior, they can establish an equilibrium where: 1. they retain almost all of their value, 2. they leave the player with a substantial (linear) regret. This study illustrates that, even if complete information is not publicly available to all arms but is shared among them, it is possible to achieve a similar equilibrium. The primary challenge lies in designing a communication protocol that incentivizes the arms to communicate truthfully.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{yahmed2024strategic,
  title  = {Strategic Arms with Side Communication Prevail Over Low-Regret MAB Algorithms},
  author = {Ahmed Ben Yahmed and Clément Calauzènes and Vianney Perchet},
  year   = {2024},
  eprint = {2408.17101},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.17101v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.17101.svg)](https://codeofpaper.com/paper/2408.17101)

Discussion