Before revision:  We design the first decentralized algorithm - \; (  ), for matching bandits under uniform valuation that does not require any knowledge of reward gaps or time horizon , and thus partially resolves an open question in \mbox{%DIFAUXCMD \cite{matching_bandits}\hspace{0pt}%DIFAUXCMD . } \;
After revision:  We design the first decentralized algorithm -  ), for matching bandits under uniform valuation that does not require any knowledge of reward gaps or time horizon , and thus partially resolves an open question in \mbox{%DIFAUXCMD \cite{matching_bandits}\hspace{0pt}%DIFAUXCMD . } \;