Ops Res
Introduction
Operations Research, 72(1)
INTEREST CATEGORY: MARKETING RESEARCH
POSTING TYPE: TOCs
Robust Risk Quantification via Shock Propagation in Financial Networks
—Dohyun Ahn, Nan Chen, and Kyoung-Kuk Kim [] []
Demand Estimation Under Uncertain Consideration Sets
—Srikanth Jagabathula, Dmitry Mitrofanov, and Gustavo Vulcano [] []
Dynamic Development Contests
—Sina Khorasani, Ersin KörpeoÄŸlu, and Vish V. Krishnan [] []
A Sequential Model for High-Volume Recruitment Under Random Yields
—Lilun Du, Qing Li, and Peiwen Yu [] []
Provably Good Region Partitioning for On-Time Last-Mile Delivery
—John Gunnar Carlsson, Sheng Liu, Nooshin Salari, and Han Yu [] []
Systemic Portfolio Diversification
—Agostino Capponi and Marko Weber [] []
Cloud Cost Optimization: Model, Bounds, and Asymptotics
—Zihao Qu, Milind Dawande, and Ganesh Janakiraman [] []
Persuading Risk-Conscious Agents: A Geometric Approach
—Jerry Anunrojwong, Krishnamurthy Iyer, and David Lingenbrink [] []
Resource-Aware Cost-Sharing Methods for Scheduling Games
—George Christodoulou, Vasilis Gkatzelis, and Alkmini Sgouritsa [] []
A Planner-Trader Decomposition for Multimarket Hydro Scheduling
—Kilian Schindler, Napat Rujeerapaiboon, Daniel Kuhn, and Wolfram Wiesemann [] []
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
—Gen Li, Yuting Wei, Yuejie Chi, and Yuxin Chen [] []
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
—Gen Li, Changxiao Cai, Yuxin Chen, Yuting Wei, and Yuejie Chi [] []
Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-Order Convergence
—Yuetian Luo, Wen Huang, Xudong Li, and Anru Zhang [] []
Estimating Large-Scale Tree Logit Models
—Srikanth Jagabathula, Paat Rusmevichientong, Ashwin Venkataraman, and Xinyi Zhao [] []
A Note on State-Independent Policies in Network Revenue Management
—Chandrasekhar Manchiraju, Milind Dawande, and Ganesh Janakiraman [] []
Incomplete Information VCG Contracts for Common Agency
—Tal Alon, Inbal Talgam-Cohen, Ron Lavi, and Elisheva Shamash [] []
Sequential Competitive Facility Location: Exact and Approximate Algorithms
—Mingyao Qi, Ruiwei Jiang, and Siqian Shen [] []
Dynamic Interday and Intraday Scheduling
—Christos Zacharias, Nan Liu, and Mehmet A. Begen [] []
Parallel Adaptive Survivor Selection
—Linda Pei, Barry L. Nelson, and Susan R. Hunter [] []
Mechanism Design Under Approximate Incentive Compatibility
—Santiago R. Balseiro, Omar Besbes, and Francisco Castro [] []
An Approximate Dynamic Programming Approach to Repeated Games with Vector Losses
—Vijay Kamble, Patrick Loiseau, and Jean Walrand [] []
Identifying Merger Opportunities: The Case of Air Traffic Control
—Nicole Adler, Ole Bent Olesen, and Nicola Volta [] []
Data-Driven Chance Constrained Programs over Wasserstein Balls
—Zhi Chen, Daniel Kuhn, and Wolfram Wiesemann [] []