Skip to main content

Table 2 Algorithms complexity

From: Distributed algorithm under cooperative or competitive priority users in cognitive networks

Learning algorithms Running time complexity Selection criteria Theoretical guarantee Convergence speed
UCB [28] \(\mathcal {O}(n(5C+4))\) Availability Yes Medium
AUCB \(\mathcal {O}(n(6C+4))\) Availability Yes Fast
QoS-UCB [12] \(\mathcal {O}(n(8C+6))\) Availability and quality Yes Medium
QoS-AUCB \(\mathcal {O}(n(9C+6))\) Availability and quality No Fast