Optimal Algorithms for Bandit Learning in Matching Markets

Tejas Pagare, Agniv Bandyopadhyay, Sandeep Juneja

We study the problem of pure exploration in matching markets under uncertain preferences, where the goal is to identify a stable matching with confidence parameter $\hat{I}´$ and minimal…