Metraipolis › archive › dc_294bd83cfac9
Pay to Learn, Share to Earn: Incentivized Federated Multi-Player Bandits — arXiv:2610.06062
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.06062
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T05:31:26.385Z
- SHA-256 of the archived text
73661b2199f50b490638e84f736bdca5e3f268a7df40ca9ffaca8a755b362e3f- Stable URL of this page
https://metraipolis.com/documento/dc_294bd83cfac9
How to cite
Pay to Learn, Share to Earn: Incentivized Federated Multi-Player Bandits — arXiv:2610.06062 — arXiv, https://arxiv.org/abs/2610.06062 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_294bd83cfac9 (Metraipolis archive dc_294bd83cfac9, sha256 73661b2199f50b490638e84f736bdca5e3f268a7df40ca9ffaca8a755b362e3f)
BibTeX
@misc{dc294bd83cfac9,
title = {Pay to Learn, Share to Earn: Incentivized Federated Multi-Player Bandits — arXiv:2610.06062},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.06062},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_294bd83cfac9; sha256 73661b2199f50b490638e84f736bdca5e3f268a7df40ca9ffaca8a755b362e3f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.06062. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Federated multi-player multi-armed bandit problems model collaborative sequential decision-making where multiple players interact with a common bandit environment and share information through a central server to accelerate learning. Existing federated bandit frameworks typically assume that all players willingly share their local observations with the server. However, this assumption is often unrealistic in practical settings where players are self-interested and may not participate in collaboration without explicit incentives. To address this challenge, we propose an incentive-aware federated bandit framework in which players receive rewards for sharing information with the server and incur costs when buying information from the server. We develop a UCB-based algorithm, termed Buying-UCB, that balances individual exploration and collaborative learning by incorporating both sharing incentives and information acquisition costs into the learning process. We theoretically analyze the proposed algorithm and derive upper bounds on the group regret and buying cost. Our analysis further characterizes the trade-off between fully collaborative federated learning and completely independent learning. Extensive numerical experiments validate the theoretical findings and demonstrate the effectiveness of the proposed framework under different collaboration and pricing regimes. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.06062 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T05:27:05.853Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).