Will Ma

According to our database, Will Ma authored at least 56 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Assortment Optimization: An Annotated Reading Assortment.

Will Ma

SIGecom Exch., 2024

Assortment Planning for Recommendations at Checkout Under Inventory Constraints.

Xi Chen, Will Ma, David Simchi-Levi, Linwei Xin

Math. Oper. Res., 2024

Selection and Ordering Policies for Hiring Pipelines via Linear Programming.

Boris Epstein, Will Ma

Oper. Res., 2024

Fair Secretaries with Unfair Predictions.

Eric Balkanski, Will Ma, Andreas Maggiori

CoRR, 2024

Survey of Data-driven Newsvendor: Unified Analysis and Spectrum of Achievable Regrets.

Zhuoxin Chen, Will Ma

CoRR, 2024

Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching.

Will Ma

CoRR, 2024

Sample Complexity of Posted Pricing for a Single Item.

Billy Jin, Thomas Kesselheim, Will Ma, Sahil Singla

CoRR, 2024

VC Theory for Inventory Policies.

Yaqi Xie, Will Ma, Linwei Xin

CoRR, 2024

Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions.

Will Ma, Calum MacRury, Jingwei Zhang

CoRR, 2024

Optimizing Inventory Placement for a Downstream Online Matching Problem.

Boris Epstein, Will Ma

CoRR, 2024

Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals.

Calum MacRury, Will Ma

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities.

Will Ma, Calum MacRury, Pranav Nuti

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

2023

Order-Optimal Correlated Rounding for Fulfilling Multi-Item E-Commerce Orders.

Will Ma

Manuf. Serv. Oper. Manag., July, 2023

When Is Assortment Optimization Optimal?

Will Ma

Manag. Sci., April, 2023

Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem.

Nick Arnosti, Will Ma

Oper. Res., 2023

Dynamic Pricing for Reusable Resources: The Power of Two Prices.

Santiago R. Balseiro, Will Ma, Wenxin Zhang

CoRR, 2023

Quality vs. Quantity of Data in Contextual Decision-Making: Exact Analysis under Newsvendor Loss.

Omar Besbes, Will Ma, Omar Mouchtaki

CoRR, 2023

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs.

Calum MacRury, Will Ma, Nathaniel Grammel

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities.

Jiashuo Jiang, Will Ma, Jiawei Zhang

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals.

Ali Aouad, Will Ma

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Designing Optimization Problems with Diverse Solutions.

Oussama Hanguir, Will Ma, Christopher Thomas Ryan

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Fairness Maximization among Offline Agents in Online-Matching Markets.

Will Ma, Pan Xu, Yifan Xu

ACM Trans. Economics and Comput., December, 2022

Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items.

Will Ma

ACM Trans. Economics and Comput., 2022

Inventory Balancing with Online Learning.

Wang Chi Cheung, Will Ma, David Simchi-Levi, Xinshang Wang

Manag. Sci., 2022

Distributionally Robust Linear and Discrete Optimization with Marginals.

Louis Chen, Will Ma, Karthik Natarajan, David Simchi-Levi, Zhenzhen Yan

Oper. Res., 2022

Technical Note - Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources.

Jackie Baek, Will Ma

Oper. Res., 2022

Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions.

Jiashuo Jiang, Will Ma, Jiawei Zhang

CoRR, 2022

Simple and Order-optimal Correlated Rounding Schemes for Multi-item E-commerce Order Fulfillment.

Will Ma

CoRR, 2022

Constructing Demand Curves from a Single Observation of Bundle Sales.

Will Ma, David Simchi-Levi

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Order Selection Problems in Hiring Pipelines.

Boris Epstein, Will Ma

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack.

Jiashuo Jiang, Will Ma, Jiawei Zhang

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model.

Billy Jin, Will Ma

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Beyond IID: data-driven decision-making in heterogeneous environments.

Omar Besbes, Will Ma, Omar Mouchtaki

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Group-level Fairness Maximization in Online Bipartite Matching.

Will Ma, Pan Xu, Yifan Xu

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Dynamic Pricing (and Assortment) Under a Static Calendar.

Will Ma, David Simchi-Levi, Jinglong Zhao

Manag. Sci., 2021

On Policies for Single-Leg Revenue Management with Limited Demand Information.

Will Ma, David Simchi-Levi, Chung-Piaw Teo

Oper. Res., 2021

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes.

Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Reaping the Benefits of Bundling under High Production Costs.

Will Ma, David Simchi-Levi

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience.

Nathaniel Grammel, Brian Brubach, Will Ma, Aravind Srinivasan

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Separation between second price auctions with personalized reserves and the revenue optimal auction.

Will Ma, Balasubramanian Sivan

Oper. Res. Lett., 2020

Strong mixed-integer programming formulations for trained neural networks.

Ross Anderson, Joey Huchette, Will Ma, Christian Tjandraatmadja, Juan Pablo Vielma

Math. Program., 2020

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios.

Will Ma, David Simchi-Levi

Oper. Res., 2020

Group-level Fairness Maximization in Online Bipartite Matching.

Will Ma, Pan Xu

CoRR, 2020

Distributionally Robust Max Flows.

Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification.

Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Assortment Auctions: A Myersonian Characterization for Markov Chain based Choice Models.

Will Ma

CoRR, 2019

Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints.

Elaheh Fata, Will Ma, David Simchi-Levi

CoRR, 2019

A Competitive Analysis of Online Knapsack Problems with Unit Density.

Will Ma, David Simchi-Levi, Jinglong Zhao

CoRR, 2019

Prophet Inequalities on the Intersection of a Matroid and a Graph.

Jackie Baek, Will Ma

CoRR, 2019

Tight Weight-dependent Competitive Ratios for Online Edge-weighted Bipartite Matching and Beyond.

Will Ma, David Simchi-Levi

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms.

Will Ma

Math. Oper. Res., 2018

Dynamic Pricing under a Static Calendar.

Will Ma, David Simchi-Levi, Jinglong Zhao

CoRR, 2018

2014

Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract.

Will Ma

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Algorithms: Full Version.

Will Ma

CoRR, 2013

2012

The Approximability and Integrality Gap of Interval Stabbing and Independence Problems.

Shalev Ben-David, Elyot Grant, Will Ma, Malcolm Sharpe

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2009

Packing and Covering Triangles in Planar Graphs.

Qing Cui, Penny Haxell, Will Ma

Graphs Comb., 2009