10 citations · 39 across the 16 of their papers we have counts for
1 paper · 1 filter
Allan Borodin, Calum MacRury, Akash Rakheja
We consider the online stochastic matching problem for bipartite graphs where edges adjacent to an online node must be probed to determine if they exist, based on known edge probab…