Will Ma

Orcid: 0000-0002-2420-4468

According to our database1, Will Ma authored at least 45 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Order-Optimal Correlated Rounding for Fulfilling Multi-Item E-Commerce Orders.
Manuf. Serv. Oper. Manag., July, 2023

When Is Assortment Optimization Optimal?
Manag. Sci., April, 2023

Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals.
CoRR, 2023

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

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

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Designing Optimization Problems with Diverse Solutions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
Fairness Maximization among Offline Agents in Online-Matching Markets.
ACM Trans. Economics and Comput., December, 2022

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

Inventory Balancing with Online Learning.
Manag. Sci., 2022

Distributionally Robust Linear and Discrete Optimization with Marginals.
Oper. Res., 2022

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

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

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

Constructing Demand Curves from a Single Observation of Bundle Sales.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Order Selection Problems in Hiring Pipelines.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model.
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.
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.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Dynamic Pricing (and Assortment) Under a Static Calendar.
Manag. Sci., 2021

On Policies for Single-Leg Revenue Management with Limited Demand Information.
Oper. Res., 2021

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes.
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.
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.
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.
Oper. Res. Lett., 2020

Strong mixed-integer programming formulations for trained neural networks.
Math. Program., 2020

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

Group-level Fairness Maximization in Online Bipartite Matching.
CoRR, 2020

Distributionally Robust Max Flows.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification.
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.
CoRR, 2019

Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints.
CoRR, 2019

A Competitive Analysis of Online Knapsack Problems with Unit Density.
CoRR, 2019

Prophet Inequalities on the Intersection of a Matroid and a Graph.
CoRR, 2019

Tight Weight-dependent Competitive Ratios for Online Edge-weighted Bipartite Matching and Beyond.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms.
Math. Oper. Res., 2018

Dynamic Pricing under a Static Calendar.
CoRR, 2018

2014
Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract.
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.
CoRR, 2013

2012
The Approximability and Integrality Gap of Interval Stabbing and Independence Problems.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2009
Packing and Covering Triangles in Planar Graphs.
Graphs Comb., 2009


  Loading...