An indirect reciprocity game theoretic framework for dynamic spectrum access
In this paper, we 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). We 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. We design a reputation updating policy under time-varying channels and prove the existence of stationary reputation distribution. We 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. Moreover, we theoretically derive the condition under which the optimal action rule is an evolutionarily stable strategy (ESS). Finally, simulation results are shown to verify the effectiveness of the proposed scheme.