default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWill Ma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Boris Epstein
, Will Ma:
Selection and Ordering Policies for Hiring Pipelines via Linear Programming. Oper. Res. 72(5): 2000-2013 (2024)- [j16]Xi Chen, Will Ma, David Simchi-Levi, Linwei Xin:
Assortment Planning for Recommendations at Checkout Under Inventory Constraints. Math. Oper. Res. 49(1): 297-325 (2024) - [c24]Calum MacRury, Will Ma:
Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. STOC 2024: 1629-1640 - [i36]Boris Epstein, Will Ma:
Optimizing Inventory Placement for a Downstream Online Matching Problem. CoRR abs/2403.04598 (2024) - [i35]Will Ma, Calum MacRury, Jingwei Zhang:
Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions. CoRR abs/2403.05378 (2024) - [i34]Yaqi Xie, Will Ma, Linwei Xin:
VC Theory for Inventory Policies. CoRR abs/2404.11509 (2024) - [i33]Billy Jin, Thomas Kesselheim, Will Ma, Sahil Singla:
Sample Complexity of Posted Pricing for a Single Item. CoRR abs/2406.00819 (2024) - [i32]Will Ma, Calum MacRury, Pranav Nuti:
Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities. CoRR abs/2406.14506 (2024) - [i31]Will Ma:
Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching. CoRR abs/2407.20419 (2024) - [i30]Zhuoxin Chen, Will Ma:
Survey of Data-driven Newsvendor: Unified Analysis and Spectrum of Achievable Regrets. CoRR abs/2409.03505 (2024) - 2023
- [j15]Nick Arnosti, Will Ma:
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. Oper. Res. 71(5): 1777-1788 (2023) - [j14]Will Ma:
When Is Assortment Optimization Optimal? Manag. Sci. 69(4): 2088-2105 (2023) - [j13]Will Ma:
Order-Optimal Correlated Rounding for Fulfilling Multi-Item E-Commerce Orders. Manuf. Serv. Oper. Manag. 25(4): 1324-1337 (2023) - [c23]Oussama Hanguir, Will Ma, Christopher Thomas Ryan:
Designing Optimization Problems with Diverse Solutions. IPCO 2023: 172-186 - [c22]Ali Aouad, Will Ma:
A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals. EC 2023: 114 - [c21]Jiashuo Jiang, Will Ma, Jiawei Zhang:
Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities. EC 2023: 909 - [c20]Will Ma:
Order-optimal Correlated Rounding for Fulfilling Multi-item E-commerce Orders. EC 2023: 962 - [c19]Calum MacRury, Will Ma, Nathaniel Grammel:
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. SODA 2023: 1995-2014 - [i29]Omar Besbes, Will Ma, Omar Mouchtaki:
Quality vs. Quantity of Data in Contextual Decision-Making: Exact Analysis under Newsvendor Loss. CoRR abs/2302.08424 (2023) - [i28]Santiago R. Balseiro, Will Ma, Wenxin Zhang:
Dynamic Pricing for Reusable Resources: The Power of Two Prices. CoRR abs/2308.13822 (2023) - [i27]Calum MacRury, Will Ma:
Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. CoRR abs/2310.10101 (2023) - 2022
- [j12]Louis Chen, Will Ma, Karthik Natarajan, David Simchi-Levi, Zhenzhen Yan:
Distributionally Robust Linear and Discrete Optimization with Marginals. Oper. Res. 70(3): 1822-1834 (2022) - [j11]Jackie Baek, Will Ma:
Technical Note - Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources. Oper. Res. 70(4): 2226-2236 (2022) - [j10]Wang Chi Cheung, Will Ma, David Simchi-Levi, Xinshang Wang:
Inventory Balancing with Online Learning. Manag. Sci. 68(3): 1776-1807 (2022) - [j9]Will Ma:
Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items. ACM Trans. Economics and Comput. 10(2): 7:1-7:32 (2022) - [j8]Will Ma, Pan Xu, Yifan Xu:
Fairness Maximization among Offline Agents in Online-Matching Markets. ACM Trans. Economics and Comput. 10(4): 16:1-16:27 (2022) - [c18]Will Ma, Pan Xu, Yifan Xu:
Group-level Fairness Maximization in Online Bipartite Matching. AAMAS 2022: 1687-1689 - [c17]Omar Besbes, Will Ma, Omar Mouchtaki:
Beyond IID: data-driven decision-making in heterogeneous environments. NeurIPS 2022 - [c16]Billy Jin, Will Ma:
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model. NeurIPS 2022 - [c15]Nick Arnosti, Will Ma:
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. EC 2022: 242 - [c14]Will Ma:
When is Assortment Optimization Optimal? EC 2022: 1081 - [c13]Jiashuo Jiang, Will Ma, Jiawei Zhang:
Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. SODA 2022: 1221-1246 - [c12]Will Ma, David Simchi-Levi:
Constructing Demand Curves from a Single Observation of Bundle Sales. WINE 2022: 150-166 - [c11]Boris Epstein, Will Ma:
Order Selection Problems in Hiring Pipelines. WINE 2022: 359-360 - [i26]Jiashuo Jiang, Will Ma, Jiawei Zhang:
Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities. CoRR abs/2205.00588 (2022) - [i25]Omar Besbes, Will Ma, Omar Mouchtaki:
Beyond IID: data-driven decision-making in heterogeneous environments. CoRR abs/2206.09642 (2022) - [i24]Billy Jin, Will Ma:
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model. CoRR abs/2206.11397 (2022) - [i23]Will Ma:
Simple and Order-optimal Correlated Rounding Schemes for Multi-item E-commerce Order Fulfillment. CoRR abs/2207.04774 (2022) - [i22]Ali Aouad, Will Ma:
A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals. CoRR abs/2208.02229 (2022) - [i21]Calum MacRury, Will Ma, Nathaniel Grammel:
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. CoRR abs/2209.07520 (2022) - [i20]Boris Epstein, Will Ma:
Order Selection Problems in Hiring Pipelines. CoRR abs/2210.04059 (2022) - [i19]Jiashuo Jiang, Will Ma, Jiawei Zhang:
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions. CoRR abs/2210.07996 (2022) - 2021
- [j7]Will Ma, David Simchi-Levi, Chung-Piaw Teo:
On Policies for Single-Leg Revenue Management with Limited Demand Information. Oper. Res. 69(1): 207-226 (2021) - [j6]Will Ma, David Simchi-Levi, Jinglong Zhao:
Dynamic Pricing (and Assortment) Under a Static Calendar. Manag. Sci. 67(4): 2292-2313 (2021) - [c10]Will Ma, David Simchi-Levi:
Reaping the Benefits of Bundling under High Production Costs. AISTATS 2021: 1342-1350 - [c9]Nathaniel Grammel, Brian Brubach, Will Ma, Aravind Srinivasan:
Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience. AISTATS 2021: 2872-2880 - [c8]Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan:
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. NeurIPS 2021: 27184-27195 - [c7]Will Ma, Pan Xu, Yifan Xu:
Fairness Maximization Among Offline Agents in Online-Matching Markets. WINE 2021: 547 - [i18]Will Ma:
When is Assortment Optimization Optimal? CoRR abs/2105.10433 (2021) - [i17]Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan:
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. CoRR abs/2106.06892 (2021) - [i16]Jiashuo Jiang, Will Ma, Jiawei Zhang:
Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. CoRR abs/2107.02058 (2021) - [i15]Nick Arnosti, Will Ma:
Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. CoRR abs/2108.12893 (2021) - [i14]Will Ma, Pan Xu, Yifan Xu:
Fairness Maximization among Offline Agents in Online-Matching Markets. CoRR abs/2109.08934 (2021) - 2020
- [j5]Will Ma, David Simchi-Levi:
Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios. Oper. Res. 68(6): 1787-1803 (2020) - [j4]Ross Anderson, Joey Huchette, Will Ma, Christian Tjandraatmadja, Juan Pablo Vielma:
Strong mixed-integer programming formulations for trained neural networks. Math. Program. 183(1): 3-39 (2020) - [j3]Will Ma, Balasubramanian Sivan:
Separation between second price auctions with personalized reserves and the revenue optimal auction. Oper. Res. Lett. 48(2): 176-179 (2020) - [c6]Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma:
The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. NeurIPS 2020 - [c5]Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi:
Distributionally Robust Max Flows. SOSA 2020: 81-90 - [c4]Will Ma:
Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items. WINE 2020: 162-176 - [i13]Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma:
The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. CoRR abs/2006.14076 (2020) - [i12]Will Ma, Pan Xu:
Group-level Fairness Maximization in Online Bipartite Matching. CoRR abs/2011.13908 (2020)
2010 – 2019
- 2019
- [c3]Will Ma, David Simchi-Levi:
Tight Weight-dependent Competitive Ratios for Online Edge-weighted Bipartite Matching and Beyond. EC 2019: 727-728 - [i11]Will Ma, David Simchi-Levi:
Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-dependent Competitive Ratios. CoRR abs/1905.04770 (2019) - [i10]Jackie Baek, Will Ma:
Prophet Inequalities on the Intersection of a Matroid and a Graph. CoRR abs/1906.04899 (2019) - [i9]Will Ma, Balasubramanian Sivan:
Separation between Second Price Auctions with Personalized Reserves and the Revenue Optimal Auction. CoRR abs/1906.11657 (2019) - [i8]Will Ma, David Simchi-Levi, Jinglong Zhao:
A Competitive Analysis of Online Knapsack Problems with Unit Density. CoRR abs/1907.08735 (2019) - [i7]Elaheh Fata, Will Ma, David Simchi-Levi:
Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints. CoRR abs/1908.09808 (2019) - [i6]Will Ma:
Assortment Auctions: A Myersonian Characterization for Markov Chain based Choice Models. CoRR abs/1909.00425 (2019) - 2018
- [j2]Will Ma:
Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms. Math. Oper. Res. 43(3): 789-812 (2018) - [i5]Wang Chi Cheung, Will Ma, David Simchi-Levi, Xinshang Wang:
Inventory Balancing with Online Learning. CoRR abs/1810.05640 (2018) - [i4]Will Ma, David Simchi-Levi, Chung-Piaw Teo:
On Policies for Single-leg Revenue Management with Limited Demand Information. CoRR abs/1810.10900 (2018) - [i3]Will Ma, David Simchi-Levi, Jinglong Zhao:
Dynamic Pricing under a Static Calendar. CoRR abs/1811.01077 (2018) - 2015
- [i2]Will Ma, David Simchi-Levi:
Reaping the Benefits of Bundling under High Production Costs. CoRR abs/1512.02300 (2015) - 2014
- [c2]Will Ma:
Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract. SODA 2014: 1154-1163 - 2013
- [i1]Will Ma:
Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Algorithms: Full Version. CoRR abs/1306.1149 (2013) - 2012
- [c1]Shalev Ben-David, Elyot Grant, Will Ma, Malcolm Sharpe:
The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. CCCG 2012: 47-52
2000 – 2009
- 2009
- [j1]Qing Cui, Penny Haxell, Will Ma:
Packing and Covering Triangles in Planar Graphs. Graphs Comb. 25(6): 817-824 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
