From: Secure relay selection based on learning with negative externality in wireless networks
Symbols and notations | Description |
---|---|
R(k,w) | Total secure data rate provided by Relay k at state w |
s i | Signal to User i |
r i | Relay selected by User i |
N k | Number of users choosing Relay k at the end of the game |
M i | Grouping results of relays before User i |
M i,k | Number of users before User i choosing Relay k |
n i,k | Number of users choosing Relay k since User i |
h i | Signal history obtained by User i |
Pr(s i |w) | Probability for User i to get the signal s i , given relay true state w |
vg(i) | Prior relay state distribution estimated by User i |
U i (R(k,w), N k ) | Utility of User i by choosing Relay k |
Pr(n i,k = y| M i ,, h i ,s i ) | Distribution of the number of users selecting Relay k after User i |
P a | Average accuracy of the signals |
P miss | Probability for a specified user to deviate from the CRG strategy |