44 citations · 132 across the 28 of their papers we have counts for
32 papers
Dynamic Pricing for Reusable Resources: The Power of Two Prices
Santiago R. Balseiro, Will Ma, Wenxin Zhang
Motivated by real-world applications such as rental and cloud computing services, we investigate pricing for reusable resources. We consider a system where a single resource with a…
From Contextual Data to Newsvendor Decisions: On the Actual Performance of Data-Driven Algorithms
Omar Besbes, Will Ma, Omar Mouchtaki
In this work, we study how the relevance/quality and quantity of past data influence performance by analyzing a contextual Newsvendor problem, in which a decision-maker trades off…
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…