11 citations · 13 across the 7 of their papers we have counts for
7 papers
Near-Optimal Bayesian Online Assortment of Reusable Resources
Yiding Feng, Rad Niazadeh, Amin Saberi
Motivated by the applications of rental services in e-commerce, we consider revenue maximization in online assortment of reusable resources for a stream of arriving consumers with…
Optimal Rounding for Two-Stage Bipartite Matching
Tristan Pollner, Amin Saberi, Anders Wikum
We study two-stage bipartite matching, in which the edges of a bipartite graph on vertices are revealed in two batches. In stage one, a matching must be selecte…
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…
New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
Mark Braverman, Mahsa Derakhshan, Tristan Pollner +2
We study the polynomial-time approximability of the optimal online stochastic bipartite matching algorithm, initiated by Papadimitriou et al. (EC'21). Here, nodes on one side of th…
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
Alexandre Hayderi, Amin Saberi, Ellen Vitercik +1
Online Bayesian bipartite matching is a central problem in digital marketplaces and exchanges, including advertising, crowdsourcing, ridesharing, and kidney exchange. We introduce…
Approximating Optimum Online for Capacitated Resource Allocation
Alexander Braun, Thomas Kesselheim, Tristan Pollner +1
We study online capacitated resource allocation, a natural generalization of online stochastic max-weight bipartite matching. This problem is motivated by ride-sharing and Internet…