THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. Online learning in a decentralized two-sided matching markets, where the demand-side (players) compete to match with the supply-side (arms), has received substantial interest because it abstracts out the complex interactions in matching platforms (e.g. UpWork, TaskRabbit). However, past works \cite{liu2020competing,liu2021bandit,ucbd3,basu2021beyond,SODA} assume that the each arm knows their preference ranking over the players (one-sided learning), and the players aim to learn the preference over arms through successive interactions. Moreover, several (impractical) assumptions on the problem are usually made for theoretical tractability such as broadcast player-arm match (\cite{liu2020competing,liu2021bandit,SODA}) or serial dictatorship (\cite{ucbd3,basu2021beyond,ghosh2022decentralized}). In this paper, we study a decentralized two sided matching market, where we do not assume that the preference ranking over players are known to the arms apriori. Furthermore, we do not have any structural assumptions on the problem. We propose a multi-phase explore-then-commit type algorithm namely epoch-based CA-ETC (collision avoidance explore then commit) (\texttt{CA-ETC} in short) for this problem that does not require any communication across agents (players and arms) and hence decentralized. We show that for the initial epoch length of $T_{\circ}$ and subsequent epoch-lengths of $2^{l/\gamma} T_{\circ}$ (for the $l-$th epoch with $\gamma \in (0,1)$ as an input parameter to the algorithm), \texttt{CA-ETC} yields a player optimal expected regret of $\mathcal{O}[T_{\circ} (\frac{K \log T}{T_{\circ} \Delta^2})^{1/\gamma}\log(\frac{K \log T}{T_{\circ} \Delta^2}) + T_{\circ} (\frac{T}{T_{\circ}})^\gamma]$ for the $i$-th player, where $T$ is the learning horizon, $K$ is the number of arms and $\Delta$ is an appropriately defined problem gap. Furthermore, we propose a blackboard communication based baseline achieving logarithmic regret in $T$.