46 citations · 46 across the 11 of their papers we have counts for
5 papers · 1 filter
Fair Secretaries with Unfair Predictions
Eric Balkanski, Will Ma, Andreas Maggiori
Algorithms with predictions is a recent framework for decision-making under uncertainty that leverages the power of machine-learned predictions without making any assumption about…
Survey of Data-driven Newsvendor: Unified Analysis and Spectrum of Achievable Regrets
Zhuoxin Chen, Will Ma
In the Newsvendor problem, the goal is to guess the number that will be drawn from some distribution, with asymmetric consequences for guessing too high vs. too low. In the data-dr…
Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching
Will Ma
Randomized rounding is a technique that was originally used to approximate hard offline discrete optimization problems from a mathematical programming relaxation. Since then it has…
Sample Complexity of Posted Pricing for a Single Item
Billy Jin, Thomas Kesselheim, Will Ma +1
Selling a single item to self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximi…
Optimizing Inventory Placement for a Downstream Online Matching Problem
Boris Epstein, Will Ma
We study the inventory placement problem of splitting units of a single item across warehouses in advance of a downstream online matching problem that represents the dynamic fu…