We study regret minimization problems in a two-sided matching market where uniformly valued demand side agents (a.k.a. agents) continuously compete for getting matched with supply side agents (a.k.a. arms)with unknown and heterogeneous valuations.
<clarity> We study regret minimization problems in a two-sided matching market where uniformly valued demand side agents (a.k.a. agents) continuously compete for getting matched with supply side agents (a.k.a. arms)with unknown and heterogeneous valuations.
We study regret minimization problems in a two-sided matching market where uniformly valued demand side agents continuously competing to be matched with supply side agents (a.k.a. arms)with unknown and heterogeneous valuations.