Will Ma

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 71

Top Topics

Revenue Management

Bipartite Matching

Dynamic Pricing

Trained Neural Networks

Top Venues

Publications

Xi Chen, Will Ma, David Simchi-Levi, Linwei Xin
Assortment Planning for Recommendations at Checkout Under Inventory Constraints. Math. Oper. Res. 49 (1) (2024)
Yaqi Xie, Will Ma, Linwei Xin
VC Theory for Inventory Policies. CoRR (2024)
Calum MacRury, Will Ma
Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. STOC (2024)
Will Ma, Calum MacRury, Pranav Nuti
Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities. CoRR (2024)
Boris Epstein, Will Ma
Optimizing Inventory Placement for a Downstream Online Matching Problem. CoRR (2024)
Will Ma, Calum MacRury, Jingwei Zhang
Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions. CoRR (2024)
Billy Jin, Thomas Kesselheim, Will Ma, Sahil Singla
Sample Complexity of Posted Pricing for a Single Item. CoRR (2024)
Will Ma
Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching. CoRR (2024)
Calum MacRury, Will Ma
Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. CoRR (2023)
Oussama Hanguir, Will Ma, Christopher Thomas Ryan
Designing Optimization Problems with Diverse Solutions. IPCO (2023)
Jiashuo Jiang, Will Ma, Jiawei Zhang
Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities. EC (2023)
Will Ma
Order-Optimal Correlated Rounding for Fulfilling Multi-Item E-Commerce Orders. Manuf. Serv. Oper. Manag. 25 (4) (2023)
Nick Arnosti, Will Ma
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. Oper. Res. 71 (5) (2023)
Will Ma
Order-optimal Correlated Rounding for Fulfilling Multi-item E-commerce Orders. EC (2023)
Omar Besbes, Will Ma, Omar Mouchtaki
Quality vs. Quantity of Data in Contextual Decision-Making: Exact Analysis under Newsvendor Loss. CoRR (2023)
Ali Aouad, Will Ma
A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals. EC (2023)
Calum MacRury, Will Ma, Nathaniel Grammel
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. SODA (2023)
Will Ma
When Is Assortment Optimization Optimal? Manag. Sci. 69 (4) (2023)
Santiago R. Balseiro, Will Ma, Wenxin Zhang
Dynamic Pricing for Reusable Resources: The Power of Two Prices. CoRR (2023)
Will Ma, David Simchi-Levi
Constructing Demand Curves from a Single Observation of Bundle Sales. WINE (2022)
Ali Aouad, Will Ma
A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals. CoRR (2022)
Nick Arnosti, Will Ma
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. EC (2022)
Jiashuo Jiang, Will Ma, Jiawei Zhang
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions. CoRR (2022)
Will Ma, Pan Xu, Yifan Xu
Group-level Fairness Maximization in Online Bipartite Matching. AAMAS (2022)
Will Ma, Pan Xu, Yifan Xu
Fairness Maximization among Offline Agents in Online-Matching Markets. ACM Trans. Economics and Comput. 10 (4) (2022)
Calum MacRury, Will Ma, Nathaniel Grammel
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. CoRR (2022)
Will Ma
Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items. ACM Trans. Economics and Comput. 10 (2) (2022)
Jiashuo Jiang, Will Ma, Jiawei Zhang
Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. SODA (2022)
Wang Chi Cheung, Will Ma, David Simchi-Levi, Xinshang Wang
Inventory Balancing with Online Learning. Manag. Sci. 68 (3) (2022)
Jiashuo Jiang, Will Ma, Jiawei Zhang
Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities. CoRR (2022)
Billy Jin, Will Ma
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model. CoRR (2022)
Louis Chen, Will Ma, Karthik Natarajan, David Simchi-Levi, Zhenzhen Yan
Distributionally Robust Linear and Discrete Optimization with Marginals. Oper. Res. 70 (3) (2022)
Boris Epstein, Will Ma
Order Selection Problems in Hiring Pipelines. WINE (2022)
Will Ma
Simple and Order-optimal Correlated Rounding Schemes for Multi-item E-commerce Order Fulfillment. CoRR (2022)
Omar Besbes, Will Ma, Omar Mouchtaki
Beyond IID: data-driven decision-making in heterogeneous environments. NeurIPS (2022)
Will Ma
When is Assortment Optimization Optimal? EC (2022)
Omar Besbes, Will Ma, Omar Mouchtaki
Beyond IID: data-driven decision-making in heterogeneous environments. CoRR (2022)
Billy Jin, Will Ma
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model. NeurIPS (2022)
Boris Epstein, Will Ma
Order Selection Problems in Hiring Pipelines. CoRR (2022)
Jackie Baek, Will Ma
Technical Note - Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources. Oper. Res. 70 (4) (2022)
Nathaniel Grammel, Brian Brubach, Will Ma, Aravind Srinivasan
Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience. AISTATS (2021)
Jiashuo Jiang, Will Ma, Jiawei Zhang
Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. CoRR (2021)
Will Ma, David Simchi-Levi, Jinglong Zhao
Dynamic Pricing (and Assortment) Under a Static Calendar. Manag. Sci. 67 (4) (2021)
Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. CoRR (2021)
Nick Arnosti, Will Ma
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. CoRR (2021)
Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. NeurIPS (2021)
Will Ma
When is Assortment Optimization Optimal? CoRR (2021)
Will Ma, David Simchi-Levi
Reaping the Benefits of Bundling under High Production Costs. AISTATS (2021)
Will Ma, Pan Xu, Yifan Xu
Fairness Maximization Among Offline Agents in Online-Matching Markets. WINE (2021)
Will Ma, Pan Xu, Yifan Xu
Fairness Maximization among Offline Agents in Online-Matching Markets. CoRR (2021)
Will Ma, David Simchi-Levi, Chung-Piaw Teo
On Policies for Single-Leg Revenue Management with Limited Demand Information. Oper. Res. 69 (1) (2021)
Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma
The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. CoRR (2020)
Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi
Distributionally Robust Max Flows. SOSA (2020)
Will Ma, David Simchi-Levi
Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios. Oper. Res. 68 (6) (2020)
Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma
The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. NeurIPS (2020)
Ross Anderson, Joey Huchette, Will Ma, Christian Tjandraatmadja, Juan Pablo Vielma
Strong mixed-integer programming formulations for trained neural networks. Math. Program. 183 (1) (2020)
Will Ma, Balasubramanian Sivan
Separation between second price auctions with personalized reserves and the revenue optimal auction. Oper. Res. Lett. 48 (2) (2020)
Will Ma, Pan Xu
Group-level Fairness Maximization in Online Bipartite Matching. CoRR (2020)
Will Ma
Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items. WINE (2020)
Will Ma
Assortment Auctions: A Myersonian Characterization for Markov Chain based Choice Models. CoRR (2019)
Will Ma, Balasubramanian Sivan
Separation between Second Price Auctions with Personalized Reserves and the Revenue Optimal Auction. CoRR (2019)
Will Ma, David Simchi-Levi
Tight Weight-dependent Competitive Ratios for Online Edge-weighted Bipartite Matching and Beyond. EC (2019)
Elaheh Fata, Will Ma, David Simchi-Levi
Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints. CoRR (2019)
Jackie Baek, Will Ma
Prophet Inequalities on the Intersection of a Matroid and a Graph. CoRR (2019)
Will Ma, David Simchi-Levi
Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-dependent Competitive Ratios. CoRR (2019)
Will Ma, David Simchi-Levi, Jinglong Zhao
A Competitive Analysis of Online Knapsack Problems with Unit Density. CoRR (2019)
Will Ma, David Simchi-Levi, Jinglong Zhao
Dynamic Pricing under a Static Calendar. CoRR (2018)
Wang Chi Cheung, Will Ma, David Simchi-Levi, Xinshang Wang
Inventory Balancing with Online Learning. CoRR (2018)
Will Ma
Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms. Math. Oper. Res. 43 (3) (2018)
Will Ma, David Simchi-Levi, Chung-Piaw Teo
On Policies for Single-leg Revenue Management with Limited Demand Information. CoRR (2018)
Will Ma, David Simchi-Levi
Reaping the Benefits of Bundling under High Production Costs. CoRR (2015)
Will Ma
Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract. SODA (2014)
Will Ma
Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Algorithms: Full Version. CoRR (2013)
Shalev Ben-David, Elyot Grant, Will Ma, Malcolm Sharpe
The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. CCCG (2012)
Qing Cui, Penny Haxell, Will Ma
Packing and Covering Triangles in Planar Graphs. Graphs Comb. 25 (6) (2009)