10 citations · 39 across the 16 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021
Prophet Matching Meets Probing with Commitment
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…
cs.DM2014★ 10 cited
Weakly Submodular Functions
Allan Borodin, Dai Tri Man Le, Yuli Ye
Submodular functions are well-studied in combinatorial optimization, game theory and economics. The natural diminishing returns property makes them suitable for many applications.…