Will Ma

According to our database1, Will Ma authored at least 16 papers between 2009 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Separation between Second Price Auctions with Personalized Reserves and the Revenue Optimal Auction.
CoRR, 2019

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

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-dependent Competitive Ratios.
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

On Policies for Single-leg Revenue Management with Limited Demand Information.
CoRR, 2018

Inventory Balancing with Online Learning.
CoRR, 2018

2015
Reaping the Benefits of Bundling under High Production Costs.
CoRR, 2015

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 and Combinatorics, 2009


  Loading...