Table 1 Notations

R

Number of candidate relays

T

The delay tolerance for the PU

β

The value of a packet

α

The time needed for checking each relay

M

The maximal number of relays that can be checked within T

X _i

The ith candidate relay

b _i

The bid of X _i

v _i

The private true valuation of X _i

Y _n

Real-valued reward function for checking X _n

\(V_{n}^{(M)}\)

Maximum reward at stage n

\(E\left (V_{n+1}^{(M)}\right)\)

Maximum expected reward at stage n+1

Z _M−n

A equal representation of \(E\left (V_{M-n+1}^{(M)}\right)\)