8 papers
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…
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…
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…
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…
Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities
Jiashuo Jiang, Will Ma, Jiawei Zhang
Prophet inequalities consist of many beautiful statements that establish tight performance ratios between online and offline allocation algorithms. Typically, tightness is establis…