HIGHLIGHTS
- who: Mahmoud Almasri from the Brest, France have published the research: Distributed algorithm under cooperative or competitive priority users in cognitive networks, in the Journal: (JOURNAL)
- what: The authors propose a modified UCB version called AUCB (Arctan-UCB) that can achieve a logarithmic regret similar to TS UCB while further reducing the total regret defined as the reward loss resulting from the selection of non-optimal channels. To evaluate AUCB's performance for the multi-user case the authors propose a novel uncooperative policy for a where the kth user should the kth best channel . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.