An Indirect Reciprocity Game Theoretic Framework for Dynamic Spectrum Access
In this paper, the authors propose a spectrum access framework to address the efficient allocation of channels of a Base Station (BS) by stimulating cooperation between Primary Users (PUs) and Secondary Users (SUs). They model the cooperation stimulation problem as an indirect reciprocity game, where SUs help PUs relay information and gain reputations to access the vacant channels in the future. They design a reputation updating policy under time-varying channels and prove the existence of stationary reputation distribution. They further formulate the decision making of an SU as a Markov Decision Process (MDP) and use a modified value iteration algorithm to find the optimal action rule.