3 papers
cs.DS2025
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…
cs.DS2024
A Bicriterion Concentration Inequality and Prophet Inequalities for -Fold Matroid Unions
Noga Alon, Nick Gravin, Tristan Pollner +4
We investigate prophet inequalities with competitive ratios approaching , seeking to generalize -uniform matroids. We first show that large girth does not suffice: for all $k…
cs.DS2024
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…