1 citations · 2 across the 4 of their papers we have counts for
4 papers
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…
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…
Governance of Social Welfare in Networked Markets
MohammadAmin Fazli, Alireza Amanihamedani
This paper aims to investigate how a central authority (e.g. a government) can increase social welfare in a network of markets and firms. In these networks, modeled using a biparti…
On the Maximum Order of Induced Paths and Induced Forests in Regular Graphs
Saieed Akbari, Alireza Amanihamedani, Sepehr Mousavi +2
Let be a graph and , LIF denote the maximum orders of an induced forest and an induced linear forest of , respectively. It is well-known that if is an -reg…