A novel individually rational objective in multi-agent multi-armed bandits: Algorithms and regret bounds
We study a two-player stochastic multi-armed bandit (MAB) problem with different expected rewards for each player, a generalisation of two-player general sum repeated games to stochastic rewards. Our aim is to find the egalitarian bargaining solution (EBS) for the repeated game, which can lead to mu...
Uložené v:
| Vydané v: | Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems Ročník 2020-May; s. 1395 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
2020
|
| Predmet: | |
| ISSN: | 1558-2914, 1548-8403 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!