2 citations · 5 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…