Distributed coordination of spectrum and the prisoner~s dilemma

In this paper we discuss distributed spectrum allocation techniques in interference limited environment. We analyze the well known iterative water-filling strategy for a simplified two players interference game, and provide closed form analysis of the cases in which the IWF is suboptimal due to the occurrence of the well known prisoner's dilemma. We then propose some alternative distributed coordination algorithm and show its superiority over IWF for real wireline access network