Will Ma - RankMe

102 papers A* 19A 4B 1Journal 72Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	AI Agents for Inventory Control: Human-LLM-OR Complementarity. CoRR Jackie Baek, Yaopeng Fu, Will Ma, Tianyi Peng
2026	J	`jnl`	DeepStock: Reinforcement Learning with Policy Regularizations for Inventory Management. CoRR Yaqi Xie, Xinru Hao, Jiaxi Liu, Will Ma, Linwei Xin, Lei Cao, Yidong Zhang
2026	J	`jnl`	Evaluating LLM-persona Generated Distributions for Decision-making. CoRR Jackie Baek, Yunhan Chen, Ziyu Chi, Will Ma
2026	A	`conf`	Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions (Extended Abstract). ITCS Will Ma, Calum MacRury, Jingwei Zhang
2026	J	`jnl`	Optimal Bayesian Stopping for Efficient Inference of Consistent LLM Answers. CoRR Jingkai Huang, Will Ma, Zhengyuan Zhou
2025	J	`jnl`	AI for evidence-based treatment recommendation in oncology: a blinded evaluation of large language models and agentic workflows. Frontiers Artif. Intell. Guannan Zhai, Merav Bar, Andrew J. Cowan, Samuel Rubinstein, Qian Shi, Ningjie Zhang, En Xie, Will Ma
2025	J	`jnl`	Beyond IID: Data-Driven Decision Making in Heterogeneous Environments. Manag. Sci. Omar Besbes, Will Ma, Omar Mouchtaki
2025	J	`jnl`	Degeneracy Is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions. Oper. Res. Jiashuo Jiang, Will Ma, Jiawei Zhang
2025	A*	`conf`	Forward-backward Contention Resolution Schemes for Fair Rationing. EC Will Ma, Calum MacRury, Cliff Stein
2025	J	`jnl`	Forward-backward Contention Resolution Schemes for Fair Rationing. CoRR Will Ma, Calum MacRury, Cliff Stein
2025	J	`jnl`	Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes. Math. Oper. Res. Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2025	J	`jnl`	On (Random-Order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. Oper. Res. Calum MacRury, Will Ma, Nathaniel Grammel
2025	J	`jnl`	Online Matching Frameworks Under Stochastic Rewards, Product Ranking, and Unknown Patience. Oper. Res. Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2025	J	`jnl`	Optimizing for strategy diversity in the design of video games. Math. Program. Oussama Hanguir, Will Ma, Jiangze Han, Christopher Thomas Ryan
2025	J	`jnl`	Personalized Promotions in Practice: Dynamic Allocation and Reference Effects. CoRR Jackie Baek, Will Ma, Dmitry Mitrofanov
2025	J	`jnl`	Potential-Based Greedy Matching for Dynamic Delivery Pooling. CoRR Hongyao Ma, Will Ma, Matías Romero
2025	J	`jnl`	Summarizing clinical evidence utilizing large language models for cancer treatments: a blinded comparative analysis. Frontiers Digit. Health Samuel M. Rubinstein, Aleenah Mohsin, Rahul Banerjee, Will Ma, Sanjay Mishra, Mary Kwok, Peter Yang, Jeremy L. Warner, Andrew J. Cowan
2025	J	`jnl`	Technical Note - Leveraging the Degree of Dynamic Substitution in Assortment and Inventory Planning. Oper. Res. Jingwei Zhang, Will Ma, Huseyin Topaloglu
2025	J	`jnl`	Tight Guarantees for Multiunit Prophet Inequalities and Online Stochastic Knapsack. Oper. Res. Jiashuo Jiang, Will Ma, Jiawei Zhang
2024	J	`jnl`	Assortment Optimization: An Annotated Reading Assortment. SIGecom Exch. Will Ma
2024	J	`jnl`	Assortment Planning for Recommendations at Checkout Under Inventory Constraints. Math. Oper. Res. Xi Chen, Will Ma, David Simchi-Levi, Linwei Xin
2024	A*	`conf`	Fair Secretaries with Unfair Predictions. NeurIPS Eric Balkanski, Will Ma, Andreas Maggiori
2024	J	`jnl`	Fair Secretaries with Unfair Predictions. CoRR Eric Balkanski, Will Ma, Andreas Maggiori
2024	J	`jnl`	Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions. CoRR Will Ma, Calum MacRury, Jingwei Zhang
2024	A*	`conf`	Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities. EC Will Ma, Calum MacRury, Pranav Nuti
2024	J	`jnl`	Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities. CoRR Will Ma, Calum MacRury, Pranav Nuti
2024	J	`jnl`	Optimizing Inventory Placement for a Downstream Online Matching Problem. CoRR Boris Epstein, Will Ma
2024	A*	`conf`	Promoting Fairness Among Dynamic Agents in Online-Matching Markets under Known Stationary Arrival Distributions. NeurIPS Will Ma, Pan Xu
2024	A*	`conf`	Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. STOC Calum MacRury, Will Ma
2024	J	`jnl`	Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching. CoRR Will Ma
2024	A*	`conf`	Sample Complexity of Posted Pricing for a Single Item. NeurIPS Billy Jin, Thomas Kesselheim, Will Ma, Sahil Singla
2024	J	`jnl`	Sample Complexity of Posted Pricing for a Single Item. CoRR Billy Jin, Thomas Kesselheim, Will Ma, Sahil Singla
2024	J	`jnl`	Selection and Ordering Policies for Hiring Pipelines via Linear Programming. Oper. Res. Boris Epstein, Will Ma
2024	J	`jnl`	Survey of Data-driven Newsvendor: Unified Analysis and Spectrum of Achievable Regrets. CoRR Zhuoxin Chen, Will Ma
2024	J	`jnl`	VC Theory for Inventory Policies. CoRR Yaqi Xie, Will Ma, Linwei Xin
2023	A*	`conf`	A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals. EC Ali Aouad, Will Ma
2023	B	`conf`	Designing Optimization Problems with Diverse Solutions. IPCO Oussama Hanguir, Will Ma, Christopher Thomas Ryan
2023	J	`jnl`	Dynamic Pricing for Reusable Resources: The Power of Two Prices. CoRR Santiago R. Balseiro, Will Ma, Wenxin Zhang
2023	A*	`conf`	On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. SODA Calum MacRury, Will Ma, Nathaniel Grammel
2023	J	`jnl`	Order-Optimal Correlated Rounding for Fulfilling Multi-Item E-Commerce Orders. Manuf. Serv. Oper. Manag. Will Ma
2023	A*	`conf`	Order-optimal Correlated Rounding for Fulfilling Multi-item E-commerce Orders. EC Will Ma
2023	J	`jnl`	Quality vs. Quantity of Data in Contextual Decision-Making: Exact Analysis under Newsvendor Loss. CoRR Omar Besbes, Will Ma, Omar Mouchtaki
2023	J	`jnl`	Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. CoRR Calum MacRury, Will Ma
2023	J	`jnl`	Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. Oper. Res. Nick Arnosti, Will Ma
2023	A*	`conf`	Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities. EC Jiashuo Jiang, Will Ma, Jiawei Zhang
2023	J	`jnl`	When Is Assortment Optimization Optimal? Manag. Sci. Will Ma
2022	J	`jnl`	A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals. CoRR Ali Aouad, Will Ma
2022	A*	`conf`	Beyond IID: data-driven decision-making in heterogeneous environments. NeurIPS Omar Besbes, Will Ma, Omar Mouchtaki
2022	J	`jnl`	Beyond IID: data-driven decision-making in heterogeneous environments. CoRR Omar Besbes, Will Ma, Omar Mouchtaki
2022	—	`conf`	Constructing Demand Curves from a Single Observation of Bundle Sales. WINE Will Ma, David Simchi-Levi
2022	J	`jnl`	Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions. CoRR Jiashuo Jiang, Will Ma, Jiawei Zhang
2022	J	`jnl`	Distributionally Robust Linear and Discrete Optimization with Marginals. Oper. Res. Louis Chen, Will Ma, Karthik Natarajan, David Simchi-Levi, Zhenzhen Yan
2022	J	`jnl`	Fairness Maximization among Offline Agents in Online-Matching Markets. ACM Trans. Economics and Comput. Will Ma, Pan Xu, Yifan Xu
2022	A	`conf`	Group-level Fairness Maximization in Online Bipartite Matching. AAMAS Will Ma, Pan Xu, Yifan Xu
2022	J	`jnl`	Inventory Balancing with Online Learning. Manag. Sci. Wang Chi Cheung, Will Ma, David Simchi-Levi, Xinshang Wang
2022	J	`jnl`	On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. CoRR Calum MacRury, Will Ma, Nathaniel Grammel
2022	A*	`conf`	Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model. NeurIPS Billy Jin, Will Ma
2022	J	`jnl`	Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model. CoRR Billy Jin, Will Ma
2022	—	`conf`	Order Selection Problems in Hiring Pipelines. WINE Boris Epstein, Will Ma
2022	J	`jnl`	Order Selection Problems in Hiring Pipelines. CoRR Boris Epstein, Will Ma
2022	J	`jnl`	Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items. ACM Trans. Economics and Comput. Will Ma
2022	J	`jnl`	Simple and Order-optimal Correlated Rounding Schemes for Multi-item E-commerce Order Fulfillment. CoRR Will Ma
2022	J	`jnl`	Technical Note - Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources. Oper. Res. Jackie Baek, Will Ma
2022	A*	`conf`	Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. SODA Jiashuo Jiang, Will Ma, Jiawei Zhang
2022	A*	`conf`	Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. EC Nick Arnosti, Will Ma
2022	J	`jnl`	Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities. CoRR Jiashuo Jiang, Will Ma, Jiawei Zhang
2022	A*	`conf`	When is Assortment Optimization Optimal? EC Will Ma
2021	J	`jnl`	Dynamic Pricing (and Assortment) Under a Static Calendar. Manag. Sci. Will Ma, David Simchi-Levi, Jinglong Zhao
2021	—	`conf`	Fairness Maximization Among Offline Agents in Online-Matching Markets. WINE Will Ma, Pan Xu, Yifan Xu
2021	J	`jnl`	Fairness Maximization among Offline Agents in Online-Matching Markets. CoRR Will Ma, Pan Xu, Yifan Xu
2021	A	`conf`	Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience. AISTATS Nathaniel Grammel, Brian Brubach, Will Ma, Aravind Srinivasan
2021	A*	`conf`	Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. NeurIPS Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2021	J	`jnl`	Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes. CoRR Brian Brubach, Nathaniel Grammel, Will Ma, Aravind Srinivasan
2021	J	`jnl`	On Policies for Single-Leg Revenue Management with Limited Demand Information. Oper. Res. Will Ma, David Simchi-Levi, Chung-Piaw Teo
2021	A	`conf`	Reaping the Benefits of Bundling under High Production Costs. AISTATS Will Ma, David Simchi-Levi
2021	J	`jnl`	Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. CoRR Jiashuo Jiang, Will Ma, Jiawei Zhang
2021	J	`jnl`	Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. CoRR Nick Arnosti, Will Ma
2021	J	`jnl`	When is Assortment Optimization Optimal? CoRR Will Ma
2020	J	`jnl`	Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios. Oper. Res. Will Ma, David Simchi-Levi
2020	—	`conf`	Distributionally Robust Max Flows. SOSA Louis L. Chen, Will Ma, James B. Orlin, David Simchi-Levi
2020	J	`jnl`	Group-level Fairness Maximization in Online Bipartite Matching. CoRR Will Ma, Pan Xu
2020	—	`conf`	Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-Price Items. WINE Will Ma
2020	J	`jnl`	Separation between second price auctions with personalized reserves and the revenue optimal auction. Oper. Res. Lett. Will Ma, Balasubramanian Sivan
2020	J	`jnl`	Strong mixed-integer programming formulations for trained neural networks. Math. Program. Ross Anderson, Joey Huchette, Will Ma, Christian Tjandraatmadja, Juan Pablo Vielma
2020	A*	`conf`	The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. NeurIPS Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma
2020	J	`jnl`	The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. CoRR Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma
2019	J	`jnl`	A Competitive Analysis of Online Knapsack Problems with Unit Density. CoRR Will Ma, David Simchi-Levi, Jinglong Zhao
2019	J	`jnl`	Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-dependent Competitive Ratios. CoRR Will Ma, David Simchi-Levi
2019	J	`jnl`	Assortment Auctions: A Myersonian Characterization for Markov Chain based Choice Models. CoRR Will Ma
2019	J	`jnl`	Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints. CoRR Elaheh Fata, Will Ma, David Simchi-Levi
2019	J	`jnl`	Prophet Inequalities on the Intersection of a Matroid and a Graph. CoRR Jackie Baek, Will Ma
2019	J	`jnl`	Separation between Second Price Auctions with Personalized Reserves and the Revenue Optimal Auction. CoRR Will Ma, Balasubramanian Sivan
2019	A*	`conf`	Tight Weight-dependent Competitive Ratios for Online Edge-weighted Bipartite Matching and Beyond. EC Will Ma, David Simchi-Levi
2018	J	`jnl`	Dynamic Pricing under a Static Calendar. CoRR Will Ma, David Simchi-Levi, Jinglong Zhao
2018	J	`jnl`	Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms. Math. Oper. Res. Will Ma
2018	J	`jnl`	Inventory Balancing with Online Learning. CoRR Wang Chi Cheung, Will Ma, David Simchi-Levi, Xinshang Wang
2018	J	`jnl`	On Policies for Single-leg Revenue Management with Limited Demand Information. CoRR Will Ma, David Simchi-Levi, Chung-Piaw Teo
2015	J	`jnl`	Reaping the Benefits of Bundling under High Production Costs. CoRR Will Ma, David Simchi-Levi
2014	A*	`conf`	Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract. SODA Will Ma
2013	J	`jnl`	Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Algorithms: Full Version. CoRR Will Ma
2012	—	`conf`	The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. CCCG Shalev Ben-David, Elyot Grant, Will Ma, Malcolm Sharpe
2009	J	`jnl`	Packing and Covering Triangles in Planar Graphs. Graphs Comb. Qing Cui, Penny Haxell, Will Ma