Finally, we simulated the scenario where the stable matching allocation was also the optimal centralized allocation, and the channels were i.i.d. across time slots (and not Markovian). We compared DSSL to the \(dE^3\)  algorithm which was designed for this setting. However, \(dE^3\)  requires communication between users since it implements a distributed auction that requires users to observe the bids of other users [1]}. We used the same parameters as selected and tuned by the authors in [1]}. Similar to the DSEE algorithm, in \(dE^3\)  the exploration-rate coefficient was determined by the channel with the largest exploration time. Thus, we expected that DSSL would yield a faster convergence rate due to the adaptive design of the exploration epochs. As shown in Fig. REF , DSSL indeed outperformed the \(dE^3\)  algorithm.
<FIGURE><FIGURE>