Packing and Covering Triangles in Planar Graphs. - Qing Cui; Penny Haxell; Will Ma (Graphs Comb., 2009)

The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. - Shalev Ben-David; Elyot Grant; Will Ma; Malcolm Sharpe (CCCG, 2012)

Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Algorithms: Full Version. - Will Ma (CoRR, 2013)

Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract. - Will Ma (SODA, 2014)

Dynamic Pricing under a Static Calendar. - Will Ma; David Simchi-Levi; Jinglong Zhao (CoRR, 2018)

Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms. - Will Ma (Math. Oper. Res., 2018)

Tight Weight-dependent Competitive Ratios for Online Edge-weighted Bipartite Matching and Beyond. - Will Ma; David Simchi-Levi (EC, 2019)

Prophet Inequalities on the Intersection of a Matroid and a Graph. - Jackie Baek; Will Ma (CoRR, 2019)

A Competitive Analysis of Online Knapsack Problems with Unit Density. - Will Ma; David Simchi-Levi; Jinglong Zhao (CoRR, 2019)

Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints. - Elaheh Fata; Will Ma; David Simchi-Levi (CoRR, 2019)

Assortment Auctions: A Myersonian Characterization for Markov Chain based Choice Models. - Will Ma (CoRR, 2019)

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 (NeurIPS, 2020)

Distributionally Robust Max Flows. - Louis L. Chen; Will Ma; James B. Orlin; David Simchi-Levi (SOSA, 2020)

Group-level Fairness Maximization in Online Bipartite Matching. - Will Ma; Pan Xu 001 (CoRR, 2020)

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios. - Will Ma; David Simchi-Levi (Oper. Res., 2020)

Strong mixed-integer programming formulations for trained neural networks. - Ross Anderson; Joey Huchette; Will Ma; Christian Tjandraatmadja; Juan Pablo Vielma (Math. Program., 2020)

Separation between second price auctions with personalized reserves and the revenue optimal auction. - Will Ma; Balasubramanian Sivan (Oper. Res. Lett., 2020)

Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience. - Nathaniel Grammel; Brian Brubach; Will Ma; Aravind Srinivasan (AISTATS, 2021)

Reaping the Benefits of Bundling under High Production Costs. - Will Ma; David Simchi-Levi (AISTATS, 2021)

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. - Brian Brubach; Nathaniel Grammel; Will Ma; Aravind Srinivasan (NeurIPS, 2021)

On Policies for Single-Leg Revenue Management with Limited Demand Information. - Will Ma; David Simchi-Levi; Chung-Piaw Teo (Oper. Res., 2021)

Dynamic Pricing (and Assortment) Under a Static Calendar. - Will Ma; David Simchi-Levi; Jinglong Zhao (Manag. Sci., 2021)

Group-level Fairness Maximization in Online Bipartite Matching. - Will Ma; Pan Xu 001; Yifan Xu 002 (AAMAS, 2022)

Beyond IID: data-driven decision-making in heterogeneous environments. - Omar Besbes; Will Ma; Omar Mouchtaki (NeurIPS, 2022)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model. - Billy Jin; Will Ma (NeurIPS, 2022)

Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. - Jiashuo Jiang; Will Ma; Jiawei Zhang 006 (SODA, 2022)

Order Selection Problems in Hiring Pipelines. - Boris Epstein 001; Will Ma (WINE, 2022)

Constructing Demand Curves from a Single Observation of Bundle Sales. - Will Ma; David Simchi-Levi (WINE, 2022)

Simple and Order-optimal Correlated Rounding Schemes for Multi-item E-commerce Order Fulfillment. - Will Ma (CoRR, 2022)

Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions. - Jiashuo Jiang; Will Ma; Jiawei Zhang 006 (CoRR, 2022)

Technical Note - Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources. - Jackie Baek; Will Ma (Oper. Res., 2022)

Distributionally Robust Linear and Discrete Optimization with Marginals. - Louis Chen; Will Ma; Karthik Natarajan; David Simchi-Levi; Zhenzhen Yan (Oper. Res., 2022)

Inventory Balancing with Online Learning. - Wang Chi Cheung; Will Ma; David Simchi-Levi; Xinshang Wang (Manag. Sci., 2022)

Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items. - Will Ma (ACM Trans. Economics and Comput., 2022)

Fairness Maximization among Offline Agents in Online-Matching Markets. - Will Ma; Pan Xu 001; Yifan Xu 002 (ACM Trans. Economics and Comput., 2022)

Designing Optimization Problems with Diverse Solutions. - Oussama Hanguir; Will Ma; Christopher Thomas Ryan (IPCO, 2023)

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals. - Ali Aouad; Will Ma (EC, 2023)

Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities. - Jiashuo Jiang; Will Ma; Jiawei Zhang 006 (EC, 2023)

Quality vs. Quantity of Data in Contextual Decision-Making: Exact Analysis under Newsvendor Loss. - Omar Besbes; Will Ma; Omar Mouchtaki (CoRR, 2023)

Dynamic Pricing for Reusable Resources: The Power of Two Prices. - Santiago R. Balseiro; Will Ma; Wenxin Zhang (CoRR, 2023)

Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. - Nick Arnosti; Will Ma (Oper. Res., 2023)

When Is Assortment Optimization Optimal? - Will Ma (Manag. Sci., 2023)

Order-Optimal Correlated Rounding for Fulfilling Multi-Item E-Commerce Orders. - Will Ma (Manuf. Serv. Oper. Manag., 2023)

Fair Secretaries with Unfair Predictions. - Eric Balkanski; Will Ma; Andreas Maggiori (NeurIPS, 2024)

Sample Complexity of Posted Pricing for a Single Item. - Billy Jin; Thomas Kesselheim; Will Ma; Sahil Singla 001 (NeurIPS, 2024)

Promoting Fairness Among Dynamic Agents in Online-Matching Markets under Known Stationary Arrival Distributions. - Will Ma; Pan Xu 001 (NeurIPS, 2024)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities. - Will Ma; Calum MacRury; Pranav Nuti (EC, 2024)

Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. - Calum MacRury; Will Ma (STOC, 2024)

Optimizing Inventory Placement for a Downstream Online Matching Problem. - Boris Epstein 001; Will Ma (CoRR, 2024)

Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions. - Will Ma; Calum MacRury; Jingwei Zhang (CoRR, 2024)

VC Theory for Inventory Policies. - Yaqi Xie; Will Ma; Linwei Xin (CoRR, 2024)

Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching. - Will Ma (CoRR, 2024)

Survey of Data-driven Newsvendor: Unified Analysis and Spectrum of Achievable Regrets. - Zhuoxin Chen; Will Ma (CoRR, 2024)

Selection and Ordering Policies for Hiring Pipelines via Linear Programming. - Boris Epstein 001; Will Ma (Oper. Res., 2024)

Assortment Planning for Recommendations at Checkout Under Inventory Constraints. - Xi Chen 010; Will Ma; David Simchi-Levi; Linwei Xin (Math. Oper. Res., 2024)

Assortment Optimization: An Annotated Reading Assortment. - Will Ma (SIGecom Exch., 2024)

Forward-backward Contention Resolution Schemes for Fair Rationing. - Will Ma; Calum MacRury; Cliff Stein 001 (EC, 2025)

Online Matching Frameworks Under Stochastic Rewards, Product Ranking, and Unknown Patience. - Brian Brubach; Nathaniel Grammel; Will Ma; Aravind Srinivasan (Oper. Res., 2025)

Tight Guarantees for Multiunit Prophet Inequalities and Online Stochastic Knapsack. - Jiashuo Jiang; Will Ma; Jiawei Zhang 006 (Oper. Res., 2025)

On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. - Calum MacRury; Will Ma; Nathaniel Grammel (Oper. Res., 2025)

Technical Note - Leveraging the Degree of Dynamic Substitution in Assortment and Inventory Planning. - Jingwei Zhang; Will Ma; Huseyin Topaloglu (Oper. Res., 2025)

Potential-Based Greedy Matching for Dynamic Delivery Pooling. - Hongyao Ma; Will Ma; Matías Romero (CoRR, 2025)

Optimizing for strategy diversity in the design of video games. - Oussama Hanguir; Will Ma; Jiangze Han; Christopher Thomas Ryan (Math. Program., 2025)