Online Stochastic Matchings: Stability on Hypergraphs
Stochastic dynamic matching on hypergraphs is studied: items of finitely many classes arrive over time and are removed in multisets by activating hyperedges, and a single $\lambda$-oblivious policy, Virtual-Queue Match-the-Longest (VQML), a rewardless variant of the Extended Greedy Primal-Dual policy of Nazari and Stol...