1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2025
Adaptive Approximation Schemes for Matching Queues
Alireza AmaniHamedani, Ali Aouad, Amin Saberi
We study a continuous-time, infinite-horizon dynamic bipartite matching problem. Suppliers arrive according to a Poisson process; while waiting, they may abandon the queue at a uni…
cs.DS2024★ 1 cited
Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence
Alireza AmaniHamedani, Ali Aouad, Tristan Pollner +1
We study stationary online bipartite matching, where both types of nodes--offline and online--arrive according to Poisson processes. Offline nodes wait to be matched for some rando…