Operations research
Año 2024, Número 1
Robust Risk Quantification via Shock Propagation in Financial Networks
Dohyun Ahn, Nan Chen, Kyoung-Kuk Kim
págs. 1-18
Demand Estimation Under Uncertain Consideration Sets
Srikanth Jagabathula, Dmitry Mitrofanov, Gustavo Vulcano
págs. 19-42
Sina Khorasani, Ersin Körpeoğlu, Vish V. Krishnan
págs. 43-59
A Sequential Model for High-Volume Recruitment Under Random Yields
Lilun Du, Qing Li, Peiwen Yu
págs. 60-90
Provably Good Region Partitioning for On-Time Last-Mile Delivery
John Gunnar Carlsson, Sheng Liu, Nooshin Salari, Han Yu
págs. 91-109
Systemic Portfolio Diversification
Agostino Capponi, Marko Weber
págs. 110-131
Technical Note—Cloud Cost Optimization: Model, Bounds, and Asymptotics
Zihao Qu, Milind Dawande, Ganesh Janakiraman
págs. 132-150
Persuading Risk-Conscious Agents: A Geometric Approach
Jerry Anunrojwong, Krishnamurthy Iyer, David Lingenbrink
págs. 151-166
Resource-Aware Cost-Sharing Methods for Scheduling Games
George Christodoulou, Vasilis Gkatzelis, Alkmini Sgouritsa
págs. 167-184
A Planner-Trader Decomposition for Multimarket Hydro Scheduling
Kilian Schindler, Napat Rujeerapaiboon, Daniel Kuhn, Wolfram Wiesemann
págs. 185-202
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
Gen Li, Yuting Wei, Yuejie Chi, Yuxin Chen
págs. 203-221
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
Gen Li, Changxiao Cai, Yuxin Chen, Yuting Wei, Yuejie Chi
págs. 222-236
Yuenian Luo, Wen Huang, Xudong Li, Anru Zhang
págs. 237-256
Estimating Large-Scale Tree Logit Models
Srikanth Jagabathula, Paat Rusmevichientong, Ashwin Venkataraman, Xinyi Zhao
págs. 257-276
Technical Note—A Note on State-Independent Policies in Network Revenue Management
Chandrasekhar Manchiraju, Milind Dawande, Ganesh Janakiraman
págs. 277-287
Technical Note—Incomplete Information VCG Contracts for Common Agency
Tal Alon, Inbal Talgam-Cohen, Ron Lavi, Elisheva Shamash
págs. 288-299
Sequential Competitive Facility Location: Exact and Approximate Algorithms
Mingyao Qi, Ruiwei Jiang, Siqian Shen
págs. 300-316
Dynamic Interday and Intraday Scheduling
Christos Zacharias, Nan Liu, Mehmet A Begen
págs. 317-335
Parallel Adaptive Survivor Selection
Linda Pei, Barry L. Nelson, Susan R. Hunter
págs. 336-354
Mechanism Design Under Approximate Incentive Compatibility
Santiago R. Balseiro, Omar Besbes, Francisco Castro
págs. 355-372
An Approximate Dynamic Programming Approach to Repeated Games with Vector Losses
Vijay Kamble, Patrick Loiseau, Jean Walrand
págs. 373-388
Identifying Merger Opportunities: The Case of Air Traffic Control
Nicole Adler, Ole Bent Olesen, Nicola Volta
págs. 389-409
Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls
Zhi Chen, Daniel Kuhn, Wolfram Wiesemann
págs. 410-424
- Página 1 de 1
