Prophet Inequalities for a New Class of Overbooking Problems in Container Shipping

A New Class of Overbooking Problems in Container Shipping Industry Container carriers lose billions of dollars each year when shippers reserve slots but fail to show up with the corresponding cargo. This paper studies an online booking problem under a deposit-based mechanism designed to better align incentives and mitigate the costs of overbooking. The authors derive near-optimal online policies for two demand settings: one in which shippers’ no-show behavior is coupled through a spot market, and another in which no-shows are independent. In the coupled setting, a randomized threshold policy guarantees at least 81.9% of clairvoyant profit. In the independent setting, a simple greedy policy is shown to be asymptotically 0.5-optimal as the number of slots tends to infinity. Extensive simulations further demonstrate strong and robust practical performance.

Authors

Institutions

Publication Details

Journal
Operations Research
Published
2026-09-17
DOI
https://doi.org/10.1287/opre.2024.0842
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

Prophet Inequalities for a New Class of Overbooking Problems in Container Shipping

Panos Kouvelis, Yukai Huang, Jacob Feldman
Operations Research
Optimization and Search Problems
article

Prophet Inequalities for a New Class of Overbooking Problems in Container Shipping

Panos Kouvelis, Yukai Huang, Jacob Feldman
article en

Abstract

A New Class of Overbooking Problems in Container Shipping Industry Container carriers lose billions of dollars each year when shippers reserve slots but fail to show up with the corresponding cargo. This paper studies an online booking problem under a deposit-based mechanism designed to better align incentives and mitigate the costs of overbooking. The authors derive near-optimal online policies for two demand settings: one in which shippers’ no-show behavior is coupled through a spot market, and another in which no-shows are independent. In the coupled setting, a randomized threshold policy guarantees at least 81.9% of clairvoyant profit. In the independent setting, a simple greedy policy is shown to be asymptotically 0.5-optimal as the number of slots tends to infinity. Extensive simulations further demonstrate strong and robust practical performance.

Operations Research
Washington University in St. Louis (US), Suffolk University (US)
Openalex Percentile: Top 8%
Optimization and Search Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Prophet Inequalities for a New Class of Overbooking Problems in Container Shipping — Panos Kouvelis, Yukai Huang, et al. · Operations Research (2026) | TGRS Research Map | TGRS