44 citations · 132 across the 28 of their papers we have counts for
8 papers · 1 filter
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
Jiashuo Jiang, Will Ma, Jiawei Zhang
We study the classical Network Revenue Management (NRM) problem with accept/reject decisions and IID arrivals. We consider a distributional form where each arrival must fall un…
Selection and Ordering Policies for Hiring Pipelines via Linear Programming
Boris Epstein, Will Ma
Motivated by hiring pipelines, we study three selection and ordering problems in which applicants for a finite set of positions must be interviewed or sent offers. There is a finit…
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
Calum MacRury, Will Ma, Nathaniel Grammel
Online Contention Resolution Schemes (OCRS's) represent a modern tool for selecting a subset of elements, subject to resource constraints, when the elements are presented to the al…
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…
Order-optimal Correlated Rounding for Fulfilling Multi-item E-commerce Orders
Will Ma
We study the dynamic fulfillment problem in e-commerce, in which incoming (multi-item) customer orders must be immediately dispatched to (a combination of) fulfillment centers that…
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…