Will Ma

According to our database1, Will Ma authored at least 22 papers between 2009 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
On Policies for Single-Leg Revenue Management with Limited Demand Information.
Oper. Res., 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

Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items.
Proceedings of the Web and Internet Economics - 16th International Conference, 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

Inventory Balancing with Online Learning.
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...