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...
Saved in:
| Published in: | Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems Vol. 2020-May; p. 1395 |
|---|---|
| Main Authors: | , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| ISSN: | 1558-2914, 1548-8403 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!