4 papers · 1 filter
A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals
Ali Aouad, Will Ma
The design of online algorithms for matching markets and revenue management settings is usually bound by the assumption that the demand process is formed by a fixed-length sequence…
Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes
Brian Brubach, Nathaniel Grammel, Will Ma +2
Matching is one of the most fundamental and broadly applicable problems across many domains. In these diverse real-world applications, there is often a degree of uncertainty in the…
The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
Will Ma, David Simchi-Levi, Jinglong Zhao
We study a wholesale supply chain ordering problem. In this problem, the supplier has an initial stock, and faces an unpredictable stream of incoming orders, making real-time decis…
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
Billy Jin, Will Ma
Two-stage bipartite matching is a fundamental problem of optimization under uncertainty introduced by Feng, Niazadeh, and Saberi (2021), who study it under the stochastic and adver…